Sciweavers

387 search results - page 19 / 78
» Reasoning About Approximate Match Query Results
Sort
View
GIS
2010
ACM
13 years 7 months ago
Supporting location-based approximate-keyword queries
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
Sattam Alsubaiee, Alexander Behm, Chen Li
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 8 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
GIS
2002
ACM
13 years 8 months ago
Web architectures for scalable moving object servers
The paper describes how the Web can be used as a support for intensive querying and display of large moving objects databases. We present first an architecture for a system which ...
Cédric du Mouza, Philippe Rigaux
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 10 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
ICDT
2001
ACM
153views Database» more  ICDT 2001»
14 years 1 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...