Sciweavers

3471 search results - page 421 / 695
» Data Stream Query Processing
Sort
View
125
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 2 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 4 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
205
Voted
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 2 months ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen
TIME
2006
IEEE
15 years 8 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
129
Voted
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 5 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach