✦ LIBER ✦

GroupK-Nearest Neighbors queries in spatial network databases

✍ Scribed by Maytham Safar

Book ID: 106276487
Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 318 KB
Volume: 10
Category: Article
ISSN: 1435-5930
DOI: 10.1007/s10109-008-0067-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Voronoi-based reverse nearest neighbor q

Voronoi-based reverse nearest neighbor query processing on spatial networks

✍ Maytham Safar; Dariush Ibrahimi; David Taniar 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 907 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

Nearest Neighbor Queries in Metric Space

Nearest Neighbor Queries in Metric Spaces

✍ K. L. Clarkson 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 175 KB

Monitoring continuousk-nearest neighbor

Monitoring continuousk-nearest neighbor queries in the hybrid wireless network

✍ Young-Mo Kwon; HaRim Jung; Yon Dohn Chung 📂 Article 📅 2011 🏛 SP Zhejiang University Press 🌐 English ⚖ 612 KB

Optimized skyline queries on road networ

Optimized skyline queries on road networks using nearest neighbors

✍ Maytham Safar; Dalal El-Amin; David Taniar 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 692 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