621 search results - page 27 / 125 » Efficient algorithms for minimizing tree pattern queries |
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
JDCTA
2010
13 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...