Sciweavers

6974 search results - page 68 / 1395
» Querying Semi-Structured Data
Sort
View
INFOSCALE
2007
ACM
13 years 9 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 11 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»
13 years 9 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»
13 years 5 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
14 years 1 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