SIGN IN
SIGN UP
Scalable network distance browsing in spatial databases
Full Text:
PDF
Buy this Article
Authors:
Hanan Samet
University of Maryland, College Park, MD, USA
Jagan Sankaranarayanan
University of Maryland, College Park, MD, USA
Houman Alborzi
University of Maryland, College Park, MD, USA
Published in:
· Proceeding
SIGMOD '08
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Pages 43-54
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-102-6
doi>
10.1145/1376616.1376623
2008 Article
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 89
· Downloads (cumulative): 1,155
· Citation Count: 61
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
decoupling
design
graphs and networks
nearest neighbor
performance
query processing
scalability
shortest path quadtree
spatial databases and gis
spatial networks
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder