Sciweavers

2514 search results - page 342 / 503
» On the Computation of Approximations of Database Queries
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
16 years 9 days ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 12 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
16 years 1 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
16 years 1 months ago
Dynamic Metadata Management for Scalable Stream Processing Systems
Adaptive query processing is of utmost importance for the scalability of data stream processing systems due to the long-running queries and fluctuating stream characteristics. An...
Michael Cammert, Jürgen Krämer, Bernhard...
NAACL
2010
15 years 4 months ago
Learning about Voice Search for Spoken Dialogue Systems
In a Wizard-of-Oz experiment with multiple wizard subjects, each wizard viewed automated speech recognition (ASR) results for utterances whose interpretation is critical to task s...
Rebecca J. Passonneau, Susan L. Epstein, Tiziana L...