Sciweavers

158 search results - page 12 / 32
» Approximate Range Mode and Range Median Queries
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
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
PARLE
1992
13 years 11 months ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
DCG
2010
289views more  DCG 2010»
13 years 7 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
PVLDB
2008
100views more  PVLDB 2008»
13 years 6 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....