958 search results - page 60 / 192 » Efficient data structures for range-aggregate queries on tre... |
98
Voted
COMPSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
205
Voted
GIS
2005
ACM
16 years 1 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
196
Voted
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Similarity search in time series data is an active area of research. In this paper, we introduce the novel concept of threshold-similarity queries in time series databases which r...
DCC
1998
IEEE
15 years 4 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
189
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...