2001 search results - page 87 / 401 » Indexing in a Hypertext Database |
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
MOBIDE
2005
ACM
14 years 2 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
IDEAS
2010
IEEE
13 years 7 months ago
2010
IEEE
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...