发布求助
文献互助 智能选刊 最新文献

2007 IEEE International Workshop on Databases for Next Generation Researchers最新文献

筛选
英文 中文
Efficient reachability test on directed graphs and its application to large XML data 有向图的有效可达性测试及其在大型XML数据中的应用
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353193
Y. Nakamura, T. Maita, H. Sakamoto
{"title":"Efficient reachability test on directed graphs and its application to large XML data","authors":"Y. Nakamura, T. Maita, H. Sakamoto","doi":"10.1109/SWOD.2007.353193","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353193","url":null,"abstract":"We propose an efficient algorithm for deciding the reachability between any nodes on XML data represented by connected directed graphs. In case of tree structures, the reachability is testable in a constant time by preprocessing the range labels of all nodes. However, in case of general directed graphs, it is impossible to set a simple range label for the graph even if it is acyclic. In this study, we introduce a new index for the problem of the reachability test on the general graphs. We show that our algorithm can check the reachability in almost constant time preserving the space efficiency and a reasonable preprocessing time compared with other methods.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Editable Browser for Reranking Web Search Results 一个可编辑的浏览器重新排序网络搜索结果
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353194
Takehiro Yamamoto, S. Nakamura, Katsumi Tanaka
{"title":"An Editable Browser for Reranking Web Search Results","authors":"Takehiro Yamamoto, S. Nakamura, Katsumi Tanaka","doi":"10.1109/SWOD.2007.353194","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353194","url":null,"abstract":"This paper proposes methods of reranking Web search results according to user's editing operations while browsing the search results. It is difficult for search engines to rank search results which satisfy the user's search intention adequately because the user's Web search intentions are diverse. Hence, the user must check search results sequentially, or re-search creating a new query. In order to solve this problem, we introduce editing operations such as deletion and emphasis for searched results. When the user deletes a part of the search results, our system degrades search results which include the deleted term or sentence. When the user emphasizes a part of the search results, our system upgrades search results which include the emphasized term or sentence. We describe the implementations of these reranking methods and provide evaluations.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134209666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
A Framework for Service-Based Query Resolution in eEnvironments e环境中基于服务的查询解析框架
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353205
M. Barhamgi, Pierre-Antoine Champin, D. Benslimane
{"title":"A Framework for Service-Based Query Resolution in eEnvironments","authors":"M. Barhamgi, Pierre-Antoine Champin, D. Benslimane","doi":"10.1109/SWOD.2007.353205","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353205","url":null,"abstract":"While recent works in P2P data management systems (PDMSs) have focused only on integrating traditional data sources, the access to an increasing number of data sources has been made in the form of data-providing Web services in P2P-based e-collaboration environments. In this paper, we supplement current PDMSs with capability to handle data sources exposed as services. In our solution we model data-providing services as RDF parametrized views. Then we devise an algorithm capable of composing the different data-providing services in order to answer a received query.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sharing Flexibly Resizable Multidimensional Arrays in Client/Server Environment 在客户端/服务器环境中共享灵活可调整大小的多维数组
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353192
Bei Li, T. Tsuj, K. Higuchi
{"title":"Sharing Flexibly Resizable Multidimensional Arrays in Client/Server Environment","authors":"Bei Li, T. Tsuj, K. Higuchi","doi":"10.1109/SWOD.2007.353192","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353192","url":null,"abstract":"Handling with large amount of data is common now. Employing extendible array to deal with increasing data is really effective. But in the conventional extendible arrays all of the operations such as extension and reduction can only occur to its surroundings. This property limits the application of extendible arrays. So we proposed our flexibly resizable multidimensional arrays which can insert or delete even in the midst of the array. In this paper we will propose a sharing scheme of resizable multidimensional arrays in a distributed environment which means the sharing of server side array by clients.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123774920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
DB-Outlier Detection by Example in High Dimensional Datasets 高维数据集db离群点检测实例
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353201
Yuan Li, H. Kitagawa
{"title":"DB-Outlier Detection by Example in High Dimensional Datasets","authors":"Yuan Li, H. Kitagawa","doi":"10.1109/SWOD.2007.353201","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353201","url":null,"abstract":"Outlier detection is an important problem with applications in many fields. Such applications generally process high dimensional datasets. Among the existing methods of detecting outliers, Distance-Based outlier (DB-Outlier) detection is one of the most commonly used and simplest approaches, since it detects outliers only by calculating distances between data points. However, in high dimensional space, data is sparse, so every data point becomes a good outlier candidate. A Subspace-Based method has been proposed to deal with the curse of dimensions. It shows that meaningful outliers are likely to be identified by examining the behavior of data in low dimensional projections. On the other hand, most existing methods detect outliers with parameters being determined by users in advance. Such parameters usually contain hidden user view of outliers. Example-Based outlier detection methods are presented to be promising in discovering the hidden user view of outliers. In this paper, we discuss a new technique to detect DB-Outliers in high dimensional datasets based on user examples. Our proposed method makes use of Subspace-Based and Example-Based methods to discover a subspace where user examples are outstanding more significantly than in any other subspaces, and reports DB-Outliers detected in this subspace.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124464139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
XPCache: An Efficient Query Processor for Client-Server Architecture XPCache:用于客户机-服务器架构的高效查询处理器
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353197
K. Taha, R. Elmasri
{"title":"XPCache: An Efficient Query Processor for Client-Server Architecture","authors":"K. Taha, R. Elmasri","doi":"10.1109/SWOD.2007.353197","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353197","url":null,"abstract":"This study addresses the problem of distributed XML queries in client-server architecture. Distributed XML documents can be large and complex. Due to the overhead involved in decomposing the queries, sending the decomposed queries to remote site(s), and executing structural join operations to compose the results, it can be difficult to rapidly execute queries on these distributed XML docs. We propose a query processor called XPCache to tackle those problems. We describe a Global Query Graph, a novel mechanism used by XPCache to classify queries based on their type and frequency. We then describe XPCache's mechanisms that exploit those classifications to improve query response time. Queries classified under the same type are given the same query optimization plan. These plans are cached at the central site. Queries classified as frequently used are answered from the central site cache, which improves query response time. The performance of XPCache is compared with another system and the results showing marked performance improvement.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128135849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Context-dependent Route Generation Scheme Using Network Voronoi Diagrams 使用网络 Voronoi 图的上下文相关路由生成方案
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353207
Tomoya Kambara, Hiroaki Kibe, R. Nishide, M. Ohnishi, S. Ueshima
{"title":"Context-dependent Route Generation Scheme Using Network Voronoi Diagrams","authors":"Tomoya Kambara, Hiroaki Kibe, R. Nishide, M. Ohnishi, S. Ueshima","doi":"10.1109/SWOD.2007.353207","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353207","url":null,"abstract":"Researches on computing an optimal route according to user's preference or spatial contexts have been gaining focus recently, as car navigation and pedestrian navigation systems are getting accustomed to be used in daily lives. In this paper, the authors propose a method to compute a path to pass through as many context areas as possible along its route, according to the user's needs. Specifically, the authors apply the concept to construct a Delaunay diagram from neighbor nodes in Voronoi diagram, and use network Voronoi diagram to construct a subgraph based on contexts. For route search, the authors use A* shortest path algorithm over the subgraph. To verify the efficiency of the proposed method with subgraphs, the authors perform route search over subgraphs and base graph, which was generated from the road network of the real space, and compare the results. The results show that the route search by the proposed method consist of more paths with context areas than those performed over the base graph. Moreover, the proposed method reduces the number of steps for path search.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126237727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Dynamic and Personalized Curriculum-Generation Method Analysing Causality and Dependency between Learning Objects 动态个性化课程生成方法——分析学习对象之间的因果关系和依赖关系
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353204
R. Konishi, Y. Takahashi, Y. Kiyoki
{"title":"Dynamic and Personalized Curriculum-Generation Method Analysing Causality and Dependency between Learning Objects","authors":"R. Konishi, Y. Takahashi, Y. Kiyoki","doi":"10.1109/SWOD.2007.353204","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353204","url":null,"abstract":"In this paper, we show a dynamic and personalized curriculum generation method that analyses the causality and dependency between learning objects. This method calculates the strength and extracts the rules of causality and dependency between individual learning objects, described beforehand, using the results of testing, trends of understanding within a particular community, and definitions of learning objects with a learning order. This method determines the important learning objects for an individual user, and an order for effective learning, by analysing the results of an individual and those of a particular community. It dynamically computes changing relationships between learning objects and the learning situation of individual users, and enables generation of a personalized curriculum that supports effective learning.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122177151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Distributed Inference System on Sensor Nodes using Neighbors' Context Data 基于邻居上下文数据的传感器节点分布式推理系统
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353208
T. Kanda, Y. Yanagisawa, T. Maekawa, M. Imai, H. Kawashima, T. Okadome
{"title":"A Distributed Inference System on Sensor Nodes using Neighbors' Context Data","authors":"T. Kanda, Y. Yanagisawa, T. Maekawa, M. Imai, H. Kawashima, T. Okadome","doi":"10.1109/SWOD.2007.353208","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353208","url":null,"abstract":"Recently, several studies have been made on techniques for the inference of contexts in indoor environments using sensor nodes attached to various objects. In existing systems, a sensor data server accumulates all data received from sensor nodes to infer contexts. However, when the number of nodes increases, the volume of the data concentrated on the server increases, and the calculation cost at the server often explodes. In order to solve this problem, we propose a distributed inference system on sensor nodes that infers the nodes' local contexts. The system has three remarkable features: 1) sensor nodes which can detect neighboring nodes, 2) inference engines on sensor nodes, which infer nodes' local contexts, and 3) sharing context data between neighbor nodes. This paper describes the implementation methods, composition, and operation examples of the system.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"45 46","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113993612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An Experimental Evaluation of the Adaptive Replica-assisted Migration for Parallel Storage Systems 并行存储系统自适应副本辅助迁移的实验评价
2007 IEEE International Workshop on Databases for Next Generation Researchers Pub Date : 2007-04-15 DOI: 10.1109/SWOD.2007.353198
D. Kobayashi, R. Taguchi, H. Yokota
{"title":"An Experimental Evaluation of the Adaptive Replica-assisted Migration for Parallel Storage Systems","authors":"D. Kobayashi, R. Taguchi, H. Yokota","doi":"10.1109/SWOD.2007.353198","DOIUrl":"https://doi.org/10.1109/SWOD.2007.353198","url":null,"abstract":"We have proposed a method replica-assisted migration that use temporally replica data in other storage nodes during executing data migration to keep both qualities of service accesses and data migration duration. However, we have not evaluated the method with real workload including update operations. In this paper, we first improve the method and evaluate an efficiency of the method under file server workloads. Base on the result of it, we also propose adaptive replica-assisted migration for reduce migration duration.","PeriodicalId":236154,"journal":{"name":"2007 IEEE International Workshop on Databases for Next Generation Researchers","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115410183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书