958 search results - page 85 / 192 » Efficient data structures for range-aggregate queries on tre... |
90
Voted
DEBS
2010
ACM
14 years 5 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
166
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
85
Voted
BROADNETS
2006
IEEE
15 years 4 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...
NIPS
1990
14 years 11 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...