Sciweavers

297 search results - page 37 / 60
» Polynomial heuristics for query optimization
Sort
View
TPDS
2008
72views more  TPDS 2008»
13 years 7 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
BTW
2007
Springer
136views Database» more  BTW 2007»
14 years 1 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
DOLAP
2000
ACM
14 years 4 days ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 8 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
VLDB
1998
ACM
108views Database» more  VLDB 1998»
13 years 12 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...