486 search results - page 67 / 98 » An Efficient Path Index for Querying Semi-structured Data |
189
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
183
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
104
click to vote
BTW
2007
Springer
15 years 3 months ago
2007
Springer
: 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, has received increasing a...
209
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
170
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...