21st International Conference on Data Engineering (ICDE'05)最新文献_第10页

A probabilistic XML approach to data integration 数据集成的概率XML方法

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.11

M. V. Keulen, A. D. Keijzer, W. Alink

{"title":"A probabilistic XML approach to data integration","authors":"M. V. Keulen, A. D. Keijzer, W. Alink","doi":"10.1109/ICDE.2005.11","DOIUrl":"https://doi.org/10.1109/ICDE.2005.11","url":null,"abstract":"In mobile and ambient environments, devices need to become autonomous, managing and resolving problems without interference from a user. The database of a (mobile) device can be seen as its knowledge about objects in the 'real world'. Data exchange between small and/or large computing devices can be used to supplement and update this knowledge whenever a connection gets established. In many situations, however, data from different data sources referring to the same real world objects, may conflict. It is the task of the data management system of the device to resolve such conflicts without interference from a user. In this paper, we take a first step in the development of a probabilistic XML DBMS. The main idea is to drop the assumption that data in the database should be certain: subtrees in XML documents may denote possible views on the real world. We formally define the notion of probabilistic XML tree and several operations thereon. We also present an approach for determining a logical semantics for queries on probabilistic XML data. Finally, we introduce an approach for XML data integration where conflicts are resolved by the introduction of possibilities in the database.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123605581","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}

引用次数: 125

Efficient creation and incremental maintenance of the HOPI index for complex XML document collections 为复杂的 XML 文档集高效创建和增量维护 HOPI 索引

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.57

Ralf Schenkel, A. Theobald, G. Weikum

引用次数: 121

Batched processing for information filters 信息过滤器的批处理

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.25

Peter M. Fischer, Donald Kossmann

引用次数: 22

Stabbing the sky: efficient skyline computation over sliding windows 刺穿天空:滑动窗口上高效的天际线计算

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.137

Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu

{"title":"Stabbing the sky: efficient skyline computation over sliding windows","authors":"Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu","doi":"10.1109/ICDE.2005.137","DOIUrl":"https://doi.org/10.1109/ICDE.2005.137","url":null,"abstract":"We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; that is, computing the skyline for the most recent n (/spl forall/n/spl les/N) elements. Firstly, we developed an effective pruning technique to minimize the number of elements to be kept. It can be shown that on average storing only O(log/sup d/ N) elements from the most recent N elements is sufficient to support the precise computation of all n-of-N skyline queries in a d-dimension space if the data distribution on each dimension is independent. Then, a novel encoding scheme is proposed, together with efficient update techniques, for the stored elements, so that computing an n-of-N skyline query in a d-dimension space takes O(log N+s) time that is reduced to O(d log log N+s) if the data distribution is independent, where s is the number of skyline points. Thirdly, a novel trigger based technique is provided to process continuous n-of-N skyline queries with O(/spl delta/) time to update the current result per new data element and O(log s) time to update the trigger list per result change, where /spl delta/ is the number of element changes from the current result to the new result. Finally, we extend our techniques to computing the skyline against an arbitrary window in the most recent N element. Besides theoretical performance guarantees, our extensive experiments demonstrated that the new techniques can support on-line skyline query computation over very rapid data streams.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116693829","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}

引用次数: 290

DCbot: exploring the Web as value-added service for location-based applications DCbot:将Web作为基于位置的应用程序的增值服务进行探索

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.46

M. Jakob, M. Großmann, Nicola Hönle, D. Nicklas

引用次数: 10

Progressive distributed top-k retrieval in peer-to-peer networks 点对点网络中的渐进式分布式top-k检索

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.115

Wolf-Tilo Balke, W. Nejdl, W. Siberski, U. Thaden

{"title":"Progressive distributed top-k retrieval in peer-to-peer networks","authors":"Wolf-Tilo Balke, W. Nejdl, W. Siberski, U. Thaden","doi":"10.1109/ICDE.2005.115","DOIUrl":"https://doi.org/10.1109/ICDE.2005.115","url":null,"abstract":"Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objects' degree of match for each different query predicate and returning the best matching objects only. In peer-to-peer systems such strategies are even more important, given the potentially large number of peers, which may contribute to the results. Yet current peer-to-peer research has barely started to investigate such approaches. In this paper we discuss the benefits of best match/top-k queries in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP topology we show how to use local indexes for optimizing the necessary query routing and how to process intermediate results in inner network nodes at the earliest possible point in time cutting down the necessary data traffic within the network. Our algorithm is based on dynamically collected query statistics only, no continuous index update processes are necessary, allowing it to scale easily to large numbers of peers, as well as dynamic additions/deletions of peers. We show our approach to always deliver correct result sets and to be optimal in terms of necessary object accesses and data traffic. Finally, we present simulation results for both static and dynamic network environments.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128617061","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}

引用次数: 209

Improving preemptive prioritization via statistical characterization of OLTP locking 通过OLTP锁定的统计特性改进抢占优先级

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.78

David T. McWherter, Bianca Schroeder, A. Ailamaki, Mor Harchol-Balter

{"title":"Improving preemptive prioritization via statistical characterization of OLTP locking","authors":"David T. McWherter, Bianca Schroeder, A. Ailamaki, Mor Harchol-Balter","doi":"10.1109/ICDE.2005.78","DOIUrl":"https://doi.org/10.1109/ICDE.2005.78","url":null,"abstract":"OLTP and transactional workloads are increasingly common in computer systems, ranging from e-commerce to warehousing to inventory management. It is valuable to provide priority scheduling in these systems, to reduce the response time for the most important clients, e.g. the \"big spenders\". Two-phase locking, commonly used in DBMS, makes prioritization difficult, as transactions wait for locks held by others regardless of priority. Common lock scheduling solutions, including non-preemptive priority inheritance and preemptive abort, have performance drawbacks for TPC-C type workloads. The contributions of this paper are two-fold: (i) We provide a detailed statistical analysis of locking in TPC-C workloads with priorities under several common preemptive and non-preemptive lock prioritization policies. We determine why non-preemptive policies fail to sufficiently help high-priority transactions, and why preemptive policies excessively hurt low-priority transactions, (ii) We propose and implement a policy, POW, that provides all the benefits of preemptive prioritization without its penalties.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121914001","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}

引用次数: 32

Adlib: a self-tuning index for dynamic peer-to-peer systems Adlib:动态对等系统的自调优索引

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.19

Prasanna Ganesan, Qixiang Sun, H. Garcia-Molina

引用次数: 23

Triggers over XML views of relational data 关系数据的XML视图上的触发器

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.147

F. Shao, Antal F. Novak, J. Shanmugasundaram

{"title":"Triggers over XML views of relational data","authors":"F. Shao, Antal F. Novak, J. Shanmugasundaram","doi":"10.1109/ICDE.2005.147","DOIUrl":"https://doi.org/10.1109/ICDE.2005.147","url":null,"abstract":"XML has emerged as a dominant standard for information exchange on the Internet. However, a large fraction of data continues to be stored in relational databases. At a high level, there are two approaches to supporting triggers over XML views. The first is to materialize the entire view and store it in an XML database with support for XML triggers. However, this approach suffers from the overhead of replicating and incrementally maintaining the materialized XML on every relational update affecting the view, even though users may only be interested in relatively rare events. In this paper, we propose the alternative approach of translating XML triggers into SQL triggers. There are some challenges involved in this approach, however, because triggers can be specified over complex XML views with nested predicates, while SQL triggers can only be specified over flat tables. Consequently, even identifying the parts of an XML view that could have changed due to a (possibly deeply nested) SQL update is a non-trivial task, as is the problem of computing the old and new values of an updated fragment of the view. We address the above challenges and propose a system architecture and an algorithm for supporting triggers over XML views of relational data. We implement and evaluate our system; the performance results indicate our techniques are a feasible approach to supporting triggers over XML views of relational data.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123016523","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}

引用次数: 11

Load and network aware query routing for information integration 负载和网络感知查询路由信息集成

21st International Conference on Data Engineering (ICDE'05) Pub Date : 2005-04-05 DOI: 10.1109/ICDE.2005.83

Wen-Syan Li, Vishal S. Batra, Vijayshankar Raman, Wei Han, K. Candan, I. Narang

引用次数: 13