✦ 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
DOI: 10.1007/bf02836661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for processing K-closest-pair

Algorithms for processing K-closest-pair queries in spatial databases

✍ A. Corral; Y. Manolopoulos; Y. Theodoridis; M. Vassilakopoulos 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 766 KB

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

Query processing in distributed database

Query processing in distributed databases with nondisjoint data

✍ Pankaj Goyal; T.S. Narayanan; Fereidoon Sadri 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 924 KB

Fast Nearest-Neighbor Query Processing i

Fast Nearest-Neighbor Query Processing in Moving-Object Databases

✍ K. Raptopoulou; A.N. Papadopoulos; Y. Manolopoulos 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 815 KB

GroupK-Nearest Neighbors queries in spat

GroupK-Nearest Neighbors queries in spatial network databases

✍ Maytham Safar 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 318 KB