1888 search results - page 82 / 378 » Algorithms for Querying by Spatial Structure |
143
click to vote
ADC
2008
Springer
15 years 6 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
176
click to vote
EDBT
2012
ACM
13 years 7 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
127
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
223
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
136
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...