Proceedings. 20th International Conference on Data Engineering最新文献_第2页

Routing XML queries 路由XML查询

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320074

Nick Koudas, M. Rabinovich, D. Srivastava, Tingbao Yu

引用次数: 40

Nile: a query processing engine for data streams 尼罗河:数据流的查询处理引擎

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320080

M. Hammad, M. Mokbel, Mohamed H. Ali, Walid G. Aref, A. Catlin, A. Elmagarmid, M. Eltabakh, Mohamed G. Elfeky, T. Ghanem, Robert Gwadera, I. Ilyas, M. Marzouk, Xiaopeng Xiong

引用次数: 134

Publish/subscribe in NonStop SQL: transactional streams in a relational context 在NonStop SQL中发布/订阅:关系上下文中的事务流

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320056

Mike Hanlon, J. Klein, B. V. D. Linden, Hansjörg Zeller

{"title":"Publish/subscribe in NonStop SQL: transactional streams in a relational context","authors":"Mike Hanlon, J. Klein, B. V. D. Linden, Hansjörg Zeller","doi":"10.1109/ICDE.2004.1320056","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1320056","url":null,"abstract":"Relational queries on continuous streams of data are the subject of many recent database research projects. In 1998 a small group of people started a similar project with the goal to transform our product, NonStop SQL/MX, into an active RDBMS. This project tried to integrate functionality of transactional queuing systems with relational tables and with SQL, using simple extensions to the SQL syntax and guaranteeing clearly defined query and transactional semantics. The result is the first commercially available RDBMS that incorporates streams. All data flowing through the system is contained in relational tables and is protected by ACID transactions. Insert and update operations on any NonStop SQL table can be considered publishing of data and can therefore be transparent to the (legacy) applications performing them. Unlike triggers, the publish operation does not increase the path length of the application and it allows the subscriber to execute in a separate transaction. Subscribers, using an extended SQL syntax, see a continuous stream of data, consisting of all rows originally in the table plus all rows that are inserted or updated thereafter. The system scales by using partitioned tables and therefore partitioned streams.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131674281","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

On local pruning of association rules using directed hypergraphs 基于有向超图的关联规则局部剪枝

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320063

S. Chawla, Joseph G. Davis, G. Pandey

引用次数: 29

A probabilistic approach to metasearching with adaptive probing 基于自适应探测的元搜索概率方法

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320026

Zhenyu Liu, C. Luo, Junghoo Cho, W. Chu

{"title":"A probabilistic approach to metasearching with adaptive probing","authors":"Zhenyu Liu, C. Luo, Junghoo Cho, W. Chu","doi":"10.1109/ICDE.2004.1320026","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1320026","url":null,"abstract":"An ever-increasing amount of valuable information is stored in Web databases, \"hidden\" behind search interfaces. To save the user's effort in manually exploring each database, metasearchers automatically select the most relevant databases to a user's query. In this paper, we focus on one of the technical challenges in metasearching, namely database selection. Past research uses a precollected summary of each database to estimate its \"relevancy\" to the query, and in many cases make incorrect database selection. In this paper, we propose two techniques: probabilistic relevancy modelling and adaptive probing. First, we model the relevancy of each database to a given query as a probabilistic distribution, derived by sampling that database. Using the probabilistic model, the user can explicitly specify a desired level of certainty for database selection. The adaptive probing technique decides which and how many databases to contact in order to satisfy the user's requirement. Our experiments on real hidden-Web databases indicate that our approach significantly improves the accuracy of database selection at the cost of a small number of database probing.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433842","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}

引用次数: 22

Spectral analysis of text collection for similarity-based clustering 基于相似度聚类的文本收集光谱分析

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320064

Wenyuan Li, W. Ng, Ee-Peng Lim

引用次数: 7

Implementation and research issues in query processing for wireless sensor networks 无线传感器网络查询处理的实现与研究

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320102

W. Hong, S. Madden

引用次数: 6

ToMAS: a system for adapting mappings while schemas evolve ToMAS:一个在模式发展时调整映射的系统

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320090

Yannis Velegrakis, Renée J. Miller, Lucian Popa, J. Mylopoulos

引用次数: 22

Selectivity estimation for string predicates: overcoming the underestimation problem 字符串谓词的选择性估计:克服低估问题

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1319999

S. Chaudhuri, Venkatesh Ganti, L. Gravano

引用次数: 68

Bulk operations for space-partitioning trees 空间分区树的批量操作

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1319982

T. Ghanem, R. Shah, M. Mokbel, Walid G. Aref, J. Vitter

{"title":"Bulk operations for space-partitioning trees","authors":"T. Ghanem, R. Shah, M. Mokbel, Walid G. Aref, J. Vitter","doi":"10.1109/ICDE.2004.1319982","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1319982","url":null,"abstract":"The emergence of extensible index structures, e.g., GiST (generalized search tree) [J.M. Hellerstein et al. (1995)] and SP-GiST (space-partitioning generalized search tree) [W. G Aref et al., (2001)], calls for a set of extensible algorithms to support different operations (e.g., insertion, deletion, and search). Extensible bulk operations (e.g., bulk loading and bulk insertion) are of the same importance and need to be supported in these index engines. In this paper, we propose two extensible buffer-based algorithms for bulk operations in the class of space-partitioning trees; a class of hierarchical data structures that recursively decompose the space into disjoint partitions. The main idea of these algorithms is to build an in-memory tree of the target space-partitioning index. Then, data items are recursively partitioned into disk-based buffers using the in-memory tree. Although the second algorithm is designed for bulk insertion, it can be used in bulk loading as well. The proposed extensible algorithms are implemented inside SP-GiST; a framework for supporting the class of space-partitioning trees. Both algorithms have I/O bound O(NH/B), where N is the number of data items to be bulk loaded/inserted, B is the number of tree nodes that can fit in one disk page, H is the tree height in terms of pages after applying a clustering algorithm. Experimental results are provided to show the scalability and applicability of the proposed algorithms for the class of space-partitioning trees. A comparison of the two proposed algorithms shows that the first algorithm performs better in case of bulk loading. However the second algorithm is more general and can be used for efficient bulk insertion.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126808481","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}

引用次数: 30