Efficient processing of large spatial queries using interior approximations

DOI10.1007/3-540-47724-1_21MaRDI QIDQ4780326zbMATH OpenFDO

Authors Ravi Kanth Kothuri, Siva Ravada

Publication date 19 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2121/21210404

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Efficient query processing in geographic information systems
• Spatial join query based orthogonal polygons approximation
• External geometric data structures
• scientific article; zbMATH DE number 1424305
• Indexing support for spatial joins

Cited in

(5)

• Fast spatial decomposition and closest pair computation for limited precision input
• Geombinatoric aspects of processing large images and large spatial databases
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
• Spatial data management for virtual product development
• A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases

This page was built for publication: Efficient processing of large spatial queries using interior approximations

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