958 search results - page 16 / 192 » Efficient data structures for range-aggregate queries on tre... |
111
Voted
ESA
2004
Springer
15 years 4 months ago
2004
Springer
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
90
Voted
ESA
2010
Springer
15 years 17 days ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
115
Voted
PVLDB
2010
14 years 7 months ago
2010
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
101
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
103
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...