Sciweavers

958 search results - page 107 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
15 years 11 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
GIS
1999
ACM
15 years 2 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
DEBU
2010
108views more  DEBU 2010»
14 years 10 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
15 years 7 months ago
Road Network Reconstruction for Organizing Paths
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
Daniel Chen, Leonidas J. Guibas, John Hershberger,...
SEMWEB
2010
Springer
14 years 8 months ago
Summary Models for Routing Keywords to Linked Data Sources
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of d...
Thanh Tran, Lei Zhang, Rudi Studer