Sciweavers

7607 search results - page 94 / 1522
» Querying data provenance
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 9 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
DASFAA
2008
IEEE
151views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui Zhou
DATESO
2009
119views Database» more  DATESO 2009»
15 years 4 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
COCOON
2005
Springer
15 years 12 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
15 years 6 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...