Sciweavers

2608 search results - page 149 / 522
» Inferring Answers to Queries
Sort
View
ICDE
2001
IEEE
111views Database» more  ICDE 2001»
16 years 7 months ago
Overcoming Limitations of Sampling for Aggregation Queries
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev...
WWW
2008
ACM
16 years 6 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...
ISPA
2004
Springer
15 years 11 months ago
Location-Dependent Query Results Retrieval in a Multi-cell Wireless Environment
The demand of information services is popular in recent years. However, the requested of correct answer in a mobile environment needs to have more attentions. This is due to the sc...
James Jayaputera, David Taniar
162
Voted
WWW
2006
ACM
16 years 6 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
15 years 11 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma