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

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

Zhiyuan Chen, H. Jagadish, Flip Korn, Nick Koudas, S. Muthukrishnan, R. Ng, D. Srivastava

{"title":"Counting twig matches in a tree","authors":"Zhiyuan Chen, H. Jagadish, Flip Korn, Nick Koudas, S. Muthukrishnan, R. Ng, D. Srivastava","doi":"10.1109/ICDE.2001.914874","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914874","url":null,"abstract":"Describes efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e. a twig, in a large node-labeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for cost-based query optimization. Our summary data structure scalably represents approximate frequency information about twiglets (i.e. small twigs) in the data tree. Given a twig query, the number of matches is estimated by creating a set of query twiglets, and combining two complementary approaches: set hashing, used to estimate the number of matches of each query twiglet, and maximal overlap, used to combine the query twiglet estimates into an estimate for the twig query. We propose several estimation algorithms that apply these approaches on query twiglets formed using variations on different twiglet decomposition techniques. We present an extensive experimental evaluation using several real XML data sets, with a variety of twig queries. Our results demonstrate that accurate and robust estimates can be achieved, even with limited space.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"54 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":"126650573","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}

引用次数: 139

Discovery and application of check constraints in DB2 DB2中检查约束的发现和应用

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

Jarek Gryz, Berni Schiefer, Jian Zheng, C. Zuzarte

引用次数: 18

E-business applications for supply chain management: challenges and solutions 供应链管理的电子商务应用:挑战和解决方案

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

F. Casati, U. Dayal, M. Shan

引用次数: 17

High-performance, space-efficient, automated object locking 高性能、空间高效、自动对象锁定

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

L. Daynès, G. Czajkowski

引用次数: 11

Duality-based subsequence matching in time-series databases 时间序列数据库中基于二象性的子序列匹配

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

Yang-Sae Moon, K. Whang, W. Loh

{"title":"Duality-based subsequence matching in time-series databases","authors":"Yang-Sae Moon, K. Whang, W. Loh","doi":"10.1109/ICDE.2001.914837","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914837","url":null,"abstract":"The authors propose a subsequence matching method, Dual Match, which exploits duality in constructing windows and significantly improves performance. Dual Match divides data sequences into disjoint windows and the query sequence into sliding windows, and thus, is a dual approach of the one by C. Faloutsos et al. (1994), which divides data sequences into sliding windows and the query sequence into disjoint windows. We formally prove that our dual approach is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of Dual Match and discuss the effect of the window size on performance. FRM causes a lot of false alarms by storing minimum bounding rectangles rather than individual points representing windows to avoid excessive storage space required for the index. Dual Match solves this problem by directly storing points, but without incurring excessive storage overhead. Experimental results show that, in most cases, Dual Match provides large improvement in both false alarms and performance over FRM, given the same amount of storage space. In particular, for low selectivities (less than 10/sup -4/), Dual Match significantly improves performance up to 430-fold. On the other hand, for high selectivities(more than 10/sup -2/), it shows a very minor degradation (less than 29%). For selectivities in between (10/sup -4//spl sim/10/sup -2/), Dual Match shows performance slightly better than that of FRM. Dual Match is also 4.10/spl sim/25.6 times faster than FRM in building indexes of approximately the same size. Overall, these results indicate that our approach provides a new paradigm in subsequence matching that improves performance significantly in large database applications.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"24 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":"115095803","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}

引用次数: 127

Integrating semi-join-reducers into state-of-the-art query processors 将半连接减少器集成到最先进的查询处理器中

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

K. Stocker, Donald Kossmann, R. Braumandl, A. Kemper

引用次数: 61

SpinCircuit: a collaborative portal powered by E-speak spinccircuit:一个由E-speak驱动的协作门户

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

Rabindra Pathak

引用次数: 1

Processing queries with expensive functions and large objects in distributed mediator systems 在分布式中介系统中处理具有昂贵函数和大型对象的查询

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

Luc Bouganim, F. Fabret, F. Porto, P. Valduriez

引用次数: 22

B/sup +/-tree indexes with hybrid row identifiers in Oracle8i B/sup +/-tree索引与混合行标识符在Oracle8i

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

E. Chong, Souripriya Das, Chuck Freiwald, Jagannathan Srinivasan, Aravind Yalamanchi, M. Jagannath, Anh-Tuan Tran, Ramkumar Krishnan

{"title":"B/sup +/-tree indexes with hybrid row identifiers in Oracle8i","authors":"E. Chong, Souripriya Das, Chuck Freiwald, Jagannathan Srinivasan, Aravind Yalamanchi, M. Jagannath, Anh-Tuan Tran, Ramkumar Krishnan","doi":"10.1109/ICDE.2001.914846","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914846","url":null,"abstract":"Most commercial database systems support B/sup +/-tree indexes using either: physical row identifiers, for example, DB2; or logical row identifiers, for example, NonStop SQL. Physical row identifiers provide fast access to data. However, unlike logical row identifiers, they need to be updated whenever the row moves. This paper describes an alternate approach where hybrid row identifiers are used. A hybrid row identifier consists of two components: a logical component, namely, the primary key of the base table row; and a physical component, namely, the database block address (DBA) of the row. By treating the DBA as a guess regarding where the row may be found, performance comparable to physical B/sup +/-tree indexes is attained for valid guess-DBAs. This scheme retains the logical index advantage of avoiding an immediate index update when the base table row moves. Instead, an online utility can be used to lazily fix the invalid guess-DBAs. This scheme has been used to implement B/sup +/-tree indexes for Oracle8i index-organized tables (primary B/sup +/-tree like structure) which encounter both row movement and table reorganization.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"223 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":"134085530","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

Distinctiveness-sensitive nearest-neighbor search for efficient similarity retrieval of multimedia information 基于特征敏感的最近邻搜索的多媒体信息相似度高效检索

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

Norio Katayama, S. Satoh

引用次数: 43