958 search results - page 56 / 192 » Efficient data structures for range-aggregate queries on tre... |
116
Voted
SSD
2001
Springer
15 years 5 months ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
127
click to vote
ICNP
2006
IEEE
15 years 6 months ago
2006
IEEE
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
87
Voted
COLING
1996
15 years 1 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
102
Voted
TKDE
1998
15 years 5 days ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
107
Voted
ICDCN
2009
Springer
15 years 5 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...