Sciweavers

964 search results - page 149 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
16 years 5 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 4 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
DOLAP
2004
ACM
15 years 9 months ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 8 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
IPPS
2007
IEEE
15 years 10 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...