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

Adaptive overlapped declustering: a highly available data-placement method balancing access load and space utilization 自适应重叠聚类:一种平衡访问负载和空间利用率的高可用数据放置方法

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

Akitsugu Watanabe, H. Yokota

引用次数: 18

Corpus-based schema matching 基于语料库的模式匹配

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

J. Madhavan, P. Bernstein, A. Doan, A. Halevy

{"title":"Corpus-based schema matching","authors":"J. Madhavan, P. Bernstein, A. Doan, A. Halevy","doi":"10.1109/ICDE.2005.39","DOIUrl":"https://doi.org/10.1109/ICDE.2005.39","url":null,"abstract":"Schema matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past solutions have proposed a principled combination of multiple algorithms. However, these solutions sometimes perform rather poorly due to the lack of sufficient evidence in the schemas being matched. In this paper we show how a corpus of schemas and mappings can be used to augment the evidence about the schemas being matched, so they can be matched better. Such a corpus typically contains multiple schemas that model similar concepts and hence enables us to learn variations in the elements and their properties. We exploit such a corpus in two ways. First, we increase the evidence about each element being matched by including evidence from similar elements in the corpus. Second, we learn statistics about elements and their relationships and use them to infer constraints that we use to prune candidate mappings. We also describe how to use known mappings to learn the importance of domain and generic constraints. We present experimental results that demonstrate corpus-based matching outperforms direct matching (without the benefit of a corpus) in multiple domains.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"35 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":"123330488","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}

引用次数: 435

Personalized queries under a generalized preference model 广义偏好模型下的个性化查询

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

G. Koutrika, Y. Ioannidis

{"title":"Personalized queries under a generalized preference model","authors":"G. Koutrika, Y. Ioannidis","doi":"10.1109/ICDE.2005.106","DOIUrl":"https://doi.org/10.1109/ICDE.2005.106","url":null,"abstract":"Query personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The underlying idea is that different users may find different things relevant to a search due to different preferences. Essential ingredients of query personalization are: (a) a model for representing and storing preferences in user profiles, and (b) algorithms for the generation of personalized answers using stored preferences. Modeling the plethora of preference types is a challenge. In this paper, we present a preference model that combines expressivity and concision. In addition, we provide efficient algorithms for the selection of preferences related to a query, and an algorithm for the progressive generation of personalized results, which are ranked based on user interest. Several classes of ranking functions are provided for this purpose. We present results of experiments both synthetic and with real users (a) demonstrating the efficiency of our algorithms, (b) showing the benefits of query personalization, and (c) providing insight as to the appropriateness of the proposed ranking functions.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"73 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":"124599338","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}

引用次数: 133

IMAX: incremental maintenance of schema-based XML statistics IMAX:基于模式的XML统计信息的增量维护

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

Maya Ramanath, L. Zhang, J. Freire, J. Haritsa

引用次数: 10

Bloom filter-based XML packets filtering for millions of path queries 基于Bloom过滤器的XML包过滤数百万个路径查询

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

Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou

引用次数: 62

Exploiting correlated attributes in acquisitional query processing 在获取查询处理中利用相关属性

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

A. Deshpande, Carlos Guestrin, W. Hong, S. Madden

{"title":"Exploiting correlated attributes in acquisitional query processing","authors":"A. Deshpande, Carlos Guestrin, W. Hong, S. Madden","doi":"10.1109/ICDE.2005.63","DOIUrl":"https://doi.org/10.1109/ICDE.2005.63","url":null,"abstract":"Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes whose observation will allow the query processor to better estimate die selectivity of these expensive predicates. In particular, we show how to build conditional plans that branch into one or more sub-plans, each with a different ordering for the expensive query predicates, based on the runtime observation of low-cost attributes. We frame the problem of constructing the optimal conditional plan for a given user query and set of candidate low-cost attributes as an optimization problem. We describe an exponential time algorithm for finding such optimal plans, and describe a polynomial-time heuristic for identifying conditional plans that perform well in practice. We also show how to compactly model conditional probability distributions needed to identify correlations and build these plans. We evaluate our algorithms against several real-world sensor-network data sets, showing several-times performance increases for a variety of queries versus traditional optimization techniques.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"77 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":"129358476","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}

引用次数: 138

Schema matching using duplicates 使用重复项进行模式匹配

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

Alexander Bilke, Felix Naumann

引用次数: 241

An enhanced query model for soccer video retrieval using temporal relationships 基于时间关系的足球视频检索增强查询模型

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

Shu‐Ching Chen, M. Shyu, Na Zhao

引用次数: 20

GPIVOT: efficient incremental maintenance of complex ROLAP views GPIVOT:对复杂的ROLAP视图进行有效的增量维护

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

Songting Chen, Elke A. Rundensteiner

{"title":"GPIVOT: efficient incremental maintenance of complex ROLAP views","authors":"Songting Chen, Elke A. Rundensteiner","doi":"10.1109/ICDE.2005.71","DOIUrl":"https://doi.org/10.1109/ICDE.2005.71","url":null,"abstract":"Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot and unpivot. Typically, such queries are fairly complex and are often executed over huge volumes of data. The solution in practice is to use materialized views to reduce the query cost. Utilizing materialized views that incorporate not just traditional simple SELECT-PROJECT-JOIN operators but also complex OLAP operators such as pivot and unpivot is crucial to improve the OLAP query performance but as of now unexplored topic. In this work, we demonstrate that the efficient maintenance of views with pivot and unpivot operators requires the definition of more generalized operators, which we call GPIVOT and GUNPIVOT. We propose rewriting rules, combination rules and propagation rules for such operators. We also design a novel view maintenance framework for applying these rules to obtain an efficient maintenance plan. Our query transformation rules are thus dual purpose serving both view maintenance and query optimization. This paves the way for the inclusion of the GPIVOT and GUNPIVOT into any DBMS engine.","PeriodicalId":297231,"journal":{"name":"21st International Conference on Data Engineering (ICDE'05)","volume":"246 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":"127492291","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}

引用次数: 28

Towards exploring interactive relationship between clusters and outliers in multi-dimensional data analysis 探讨多维数据分析中聚类与离群值之间的交互关系

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

Yong Shi, A. Zhang

引用次数: 10