1388 search results - page 40 / 278 » Querying Linguistic Trees |
95
Voted
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
167
click to vote
SIGMOD
2005
ACM
16 years 19 days ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
PODS
2004
ACM
16 years 18 days ago
2004
ACM
DASFAA
2004
IEEE
15 years 4 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
106
Voted
VLDB
2000
ACM
15 years 4 months ago
2000
ACM
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...