1429 search results - page 142 / 286 » Efficient processing of XPath queries using indexes |
137
click to vote
VLDB
1991
ACM
15 years 6 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...
223
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
136
click to vote
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
Relevance feedback is an attractive approach to developing flexible metrics for content-based retrieval in image and video databases. Large image databases require an index struct...
214
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with th...
128
click to vote
VLDB
1995
ACM
15 years 6 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...