92 search results - page 1 / 19 » Conjunctive Query Evaluation by Search Tree Revisited |
ICDT
2005
ACM
13 years 11 months ago
2005
ACM
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
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...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
SPIRE
2004
Springer
13 years 10 months ago
2004
Springer
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
IPL
2006
13 years 5 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...