Sciweavers

6650 search results - page 307 / 1330
» Mutating database queries
Sort
View
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
16 years 4 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
ICDE
2005
IEEE
114views Database» more  ICDE 2005»
15 years 10 months ago
VAMANA - A Scalable Cost-Driven XPath Engine
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
Venkatesh Raghavan, Kurt W. Deschler, Elke A. Rund...
CIKM
2006
Springer
15 years 6 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 5 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
IDEAS
2008
IEEE
109views Database» more  IDEAS 2008»
15 years 11 months ago
EXsum: an XML summarization framework
1 We propose a new framework for the summarization of XML document properties called EXsum (Element-wise XML summarization), which can capture statistical information of all import...
José de Aguiar Moraes Filho, Theo Härd...