A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases

DOI10.1137/S0097539700368527zbMATH Open1086.68039MaRDI QIDQ5700568FDOQ5700568

Authors: Michael Lindenbaum, Hanan Samet, Gisli R. Hjaltason 

Publication date: 28 October 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• A Sorting Approach to Indexing Spatial Data
• Querying probabilistic neighborhoods in spatial data sets efficiently
• Efficient computation of a proximity matching in spatial databases
• scientific article; zbMATH DE number 1832337
• Near optimal line segment queries in simple polygons
• Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
• Topological queries in spatial databases

zbMATH Keywords

analysis of algorithmsgeometric probabilitycost modelquery evaluationtriesquadtreesspatial data structuresquadtrieslarge spatial databasessorting line segments

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Database theory (68P15)

Cited In (2)

• Title not available (Why is that?)
• Skyline ranking for uncertain databases

This page was built for publication: A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700568)