Sciweavers

407 search results - page 12 / 82
» Top-k typicality queries and efficient query answering metho...
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
13 years 10 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
13 years 11 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
PVLDB
2008
131views more  PVLDB 2008»
13 years 6 months ago
Learning to create data-integrating queries
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...
Partha Pratim Talukdar, Marie Jacob, Muhammad Salm...
ICDE
2010
IEEE
268views Database» more  ICDE 2010»
14 years 7 months ago
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
This tutorial provides a comprehensive and comparative overview of general techniques to efficiently support similarity queries in spatial, temporal, spatio-temporal, and multimedi...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...