๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Processing constrainedKclosest pairs query in spatial databases

โœ Scribed by Liu Xiaofeng; Liu Yungsheng; Xiao Yingyuan


Book ID
105629102
Publisher
Wuhan University
Year
2006
Tongue
English
Weight
353 KB
Volume
11
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Topological Queries in Spatial Databases
โœ CH. Papadimitriou; D. Suciu; V. Vianu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

We study topological queries over two-dimensional spatial databases. First, we show that the topological properties of semialgebraic spatial regions can be completely specified using a classical finite structure, essentially the embedded planar graph of the region boundaries. This provides an invari

Query processing in database systems
โœ Zvieli, Arie ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 786 KB