1888 search results - page 241 / 378 » Algorithms for Querying by Spatial Structure |
SSD
2009
Springer
14 years 3 months ago
2009
Springer
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
EUROPAR
2001
Springer
14 years 1 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...