4302 search results - page 371 / 861 » Index Pairs Algorithms |
152
click to vote
ICDT
2003
ACM
15 years 10 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
138
Voted
CPM
2007
Springer
15 years 9 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
106
click to vote
CLEF
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we will describe the Berkeley approaches to the GeoCLEF tasks for CLEF 2006. This year we used two separate systems for different tasks. Although of the systems both...
139
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
154
click to vote
VLDB
1991
ACM
15 years 8 months ago
1991
ACM
We propose a two-pha.se algorithm for physical database design. In phase one the algorithm, for each logical query, losesrules to determine characteristics of a physical design (s...