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

XML data and object databases: the perfect couple? XML数据和对象数据库:完美的一对?

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

Andreas Renner

引用次数: 25

B-tree indexes and CPU caches b树索引和CPU缓存

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

G. Graefe, P. Larson

引用次数: 116

Efficient bulk deletes in relational databases 在关系数据库中高效的批量删除

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

Andreas Gärtner, A. Kemper, Donald Kossmann, Bernhard Zeller

引用次数: 28

Cache-on-demand: recycling with certainty 按需缓存:确定回收

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

K. Tan, S. Goh, B. Ooi

引用次数: 22

Quality-aware and load sensitive planning of image similarity queries 图像相似度查询的质量敏感和负载敏感规划

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

Klemens Böhm, M. Mlivoncic, R. Weber

引用次数: 13

The MD-join: an operator for complex OLAP MD-join:用于复杂OLAP的操作符

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

Damianos Chatziantoniou, M. Akinde, T. Johnson, Samuel Kim

{"title":"The MD-join: an operator for complex OLAP","authors":"Damianos Chatziantoniou, M. Akinde, T. Johnson, Samuel Kim","doi":"10.1109/ICDE.2001.914866","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914866","url":null,"abstract":"OLAP queries (i.e. group-by or cube-by queries with aggregation) have proven to be valuable for data analysis and exploration. Many decision support applications need very complex OLAP queries, requiring a fine degree of control over both the group definition and the aggregates that are computed. For example, suppose that the user has access to a data cube whose measure attribute is Sum(Sales). Then the user might wish to compute the sum of sales in New York and the sum of sales in California for those data cube entries in which Sum(Sales)>$1,000,000. This type of complex OLAP query is often difficult to express and difficult to optimize using standard relational operators (including standard aggregation operators). In this paper, we propose the MD-join operator for complex OLAP queries. The MD-join provides a clean separation between group definition and aggregate computation, allowing great flexibility in the expression of OLAP queries. In addition, the MD-join has a simple and easily optimizable implementation, while the equivalent relational algebra expression is often complex and difficult to optimize. We present several algebraic transformations that allow relational algebra queries that include MD-joins to be optimized.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"260 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":"133763850","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}

引用次数: 73

Approximate nearest neighbor searching in multimedia databases 多媒体数据库中的近似近邻搜索

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

H. Ferhatosmanoğlu, E. Tuncel, D. Agrawal, A. E. Abbadi

{"title":"Approximate nearest neighbor searching in multimedia databases","authors":"H. Ferhatosmanoğlu, E. Tuncel, D. Agrawal, A. E. Abbadi","doi":"10.1109/ICDE.2001.914864","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914864","url":null,"abstract":"Develops a general framework for approximate nearest-neighbor queries. We categorize the current approaches for nearest-neighbor query processing based on either their ability to reduce the data set that needs to be examined, or their ability to reduce the representation size of each data object. We first propose modifications to well-known techniques to support the progressive processing of approximate nearest-neighbor queries. A user may therefore stop the retrieval process once enough information has been returned. We then develop a new technique based on clustering that merges the benefits of the two general classes of approaches. Our cluster-based approach allows a user to progressively explore the approximate results with increasing accuracy. We propose a new metric for evaluation of approximate nearest-neighbor searching techniques. Using both the proposed and the traditional metrics, we analyze and compare several techniques with a detailed performance evaluation. We demonstrate the feasibility and efficiency of approximate nearest-neighbor searching. We perform experiments on several real data sets and establish the superiority of the proposed cluster-based technique over the existing techniques for approximate nearest-neighbor searching.","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":"130990028","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}

引用次数: 132

A cost model and index architecture for the similarity join 相似性连接的成本模型和索引体系结构

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

C. Böhm, H. Kriegel

引用次数: 67

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

R. S. Filho, A. Traina, C. Traina, C. Faloutsos

引用次数: 154

Mining partially periodic event patterns with unknown periods 挖掘具有未知周期的部分周期事件模式

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

Sheng Ma, J. Hellerstein

{"title":"Mining partially periodic event patterns with unknown periods","authors":"Sheng Ma, J. Hellerstein","doi":"10.1109/ICDE.2001.914829","DOIUrl":"https://doi.org/10.1109/ICDE.2001.914829","url":null,"abstract":"Periodic behavior is common in real-world applications. However in many cases, periodicities are partial in that they are present only intermittently. The authors study such intermittent patterns, which they refer to as p-patterns. The formulation of p-patterns takes into account imprecise time information (e.g., due to unsynchronized clocks in distributed environments), noisy data (e.g., due to extraneous events), and shifts in phase and/or periods. We structure mining for p-patterns as two sub-tasks: (1) finding the periods of p-patterns and (2) mining temporal associations. For (2), a level-wise algorithm is used. For (1), we develop a novel approach based on a chi-squared test, and study its performance in the presence of noise. Further we develop two algorithms for mining p-patterns based on the order in which the aforementioned sub-tasks are performed: the period-first algorithm and the association-first algorithm. Our results show that the association-first algorithm has a higher tolerance to noise; the period-first algorithm is more computationally efficient and provides flexibility as to the specification of support levels. In addition, we apply the period-first algorithm to mining data collected from two production computer networks, a process that led to several actionable insights.","PeriodicalId":431818,"journal":{"name":"Proceedings 17th International Conference on Data Engineering","volume":"6 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":"127188657","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}

引用次数: 279