Sciweavers

1888 search results - page 146 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
174
Voted
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
15 years 7 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
258
Voted
ICDE
2009
IEEE
165views Database» more  ICDE 2009»
16 years 7 months ago
Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
Zhengdao Xu, Hans-Arno Jacobsen
247
Voted
ICDE
2002
IEEE
128views Database» more  ICDE 2002»
16 years 7 months ago
Efficiently Ordering Query Plans for Data Integration
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
AnHai Doan, Alon Y. Halevy
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 6 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
FOCS
1998
IEEE
15 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello