96 search results - page 7 / 20 » PTIME Queries Revisited |
MST
2010
13 years 2 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Multi-join queries are the core of any integration service that integrates data from multiple distributed data sources. Due to the large number of data sources and possibly high v...
WEBDB
2005
Springer
14 years 1 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
