Proceedings 17th International Conference on Data Engineering最新文献_第7页

An index structure for efficient reverse nearest neighbor queries 用于高效反向最近邻查询的索引结构

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914862

Congjun Yang, King-Ip Lin

{"title":"An index structure for efficient reverse nearest neighbor queries","authors":"Congjun Yang, King-Ip Lin","doi":"10.1109/ICDE.2001.914862","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914862","url":null,"abstract":"The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Just like the Nearest Neighbor (NN) queries, the RNN queries appear in many practical situations such as marketing and resource management. Thus, efficient methods for the RNN queries in databases are required. The paper introduces a new index structure, the Rdnn-tree, that answers both RNN and NN queries efficiently. A single index structure is employed for a dynamic database, in contrast to the use of multiple indexes in previous work. This leads to significant savings in dynamically maintaining the index structure. The Rdnn-tree outperforms existing methods in various aspects. Experiments on both synthetic and real world data show that our index structure outperforms previous methods by a significant margin (more than 90% in terms of number of leaf nodes accessed) in RNN queries. It also shows improvement in NN queries over standard techniques. Furthermore, performance in insertion and deletion is significantly enhanced by the ability to combine multiple queries (NN and RNN) in one traversal of the tree. These facts make our index structure extremely preferable in both static and dynamic cases.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115789428","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}

引用次数: 186

An efficient approximation scheme for data mining tasks 数据挖掘任务的有效逼近方案

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914858

G. Kollios, D. Gunopulos, Nick Koudas, Stefan Berchtold

引用次数: 29

Tuning an SQL-based PDM system in a worldwide client/server environment 在全球客户机/服务器环境中调优基于sql的PDM系统

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914818

Erich Müller, P. Dadam, Jost Enderle, M. Feltes

引用次数: 6

Measuring and optimizing a system for persistent database sessions 测量和优化持久化数据库会话的系统

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914810

R. Barga, D. Lomet

{"title":"Measuring and optimizing a system for persistent database sessions","authors":"R. Barga, D. Lomet","doi":"10.1109/ICDE.2001.914810","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914810","url":null,"abstract":"High availability for both data and applications is rapidly becoming a business requirement. While database systems support recovery, providing high database availability, applications may still lose work because of server outages. When a server crashes, any volatile state associated with the application's database session is lost and the application may require an operator-assisted restart. This exposes server failures to end-users and always degrades application availability. Our Phoenix/ODBC system supports persistent database sessions that can survive a database crash without the application being aware of the outage, except for possible timing considerations. This improves application availability and eliminates the application programming needed to cope with database crashes. Phoenix/ODBC requires no changes to the database system, data access routines or applications. Hence, it can be deployed in any application that uses ODBC to access a database. Further, our generic approach can be exploited for a variety of data access protocols. In this paper, we describe the design of Phoenix/ODBC and introduce an extension to optimize the response time and to reduce overhead for OLTP workloads. We present a performance evaluation using the TPC-C and TPC-H benchmarks that demonstrate Phoenix/ODBC's extra overhead is modest.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131508968","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

Mining frequent itemsets with convertible constraints 挖掘具有可转换约束的频繁项集

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914856

J. Pei, Jiawei Han, L. Lakshmanan

引用次数: 385

On dual mining: from patterns to circumstances, and back 关于双重挖掘:从模式到环境，再回来

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914828

G. Grahne, L. Lakshmanan, Xiaohong Wang, M. Xie

引用次数: 19

Exactly-once semantics in a replicated messaging system 复制消息传递系统中的一次语义

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914808

Yongqiang Huang, H. Garcia-Molina

引用次数: 17

An index-based approach for similarity search supporting time warping in large sequence databases 一种支持大型序列数据库时间规整的基于索引的相似性搜索方法

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914875

Sang-Wook Kim, Sanghyun Park, W. Chu

{"title":"An index-based approach for similarity search supporting time warping in large sequence databases","authors":"Sang-Wook Kim, Sanghyun Park, W. Chu","doi":"10.1109/ICDE.2001.914875","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914875","url":null,"abstract":"This paper proposes a new novel method for similarity search that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. Previous methods for processing similarity search that supports time warping fail to employ multi-dimensional indexes without false dismissal since the time warping distance does not satisfy the triangular inequality. Our primary goal is to innovate on search performance without permitting any false dismissal. To attain this goal, we devise a new distance function D/sub tw-lb/ that consistently underestimates the time warping distance and also satisfies the triangular inequality D/sub tw-lb/ uses a 4-tuple feature vector that is extracted from each sequence and is invariant to time warping. For efficient processing of similarity search, we employ a multi-dimensional index that uses the 4-tuple feature vector as indexing attributes and D/sub tw-lb/ as a distance function. The extensive experimental results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data and up to 720 times with very large synthetic data.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129251051","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}

引用次数: 324

Rewriting OLAP queries using materialized views and dimension hierarchies in data warehouses 在数据仓库中使用物化视图和维度层次重写OLAP查询

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-04-02 DOI: 10.1109/ICDE.2001.914865

Chang-Sup Park, Myoung-Ho Kim, Yoon-Joon Lee

引用次数: 37

Bringing the Internet to your database: using SQL server 2000 and XML to build loosely-coupled systems 将Internet引入数据库:使用SQL server 2000和XML构建松耦合系统

Proceedings 17th International Conference on Data Engineering Pub Date : 2001-03-07 DOI: 10.1109/ICDE.2001.914859

M. Rys

引用次数: 57