NDLI: Processing in-route nearest neighbor queries: a comparison of alternative approaches

Please wait, while we are loading the content...

Nearest neighbor queries in road networks

Processing in-route nearest neighbor queries: a comparison of alternative approaches

An efficient R-tree implementation over flash-memory storage systems

Indexing of network constrained moving objects

A reference framework for integrating multiple representations of geographical maps

Statistical tools for regional data analysis using GIS

Detecting region outliers in meteorological data

Attribute space visualization of demographic change

Morphology-driven simplification and multiresolution modeling of terrains

Constructing a dem from grid-based data by computing intermediate contours

Exploiting 2D concepts to achieve consistency in 3D GIS applications

Modeling and comparing change using spatiotemporal helixes

A multigranular spatiotemporal data model

Extension of spatial metadata and agent-based spatial Data navigation mechanism

Towards scalable location-aware services: requirements and research issues

Computational data modeling for network-constrained moving objects

A predictive location model for location-based services

Construction of the planar partition postal code map based on cadastral reGIStration

An error model of circular curve features in GIS

Phenomena: a visual query language for continuous fields

The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network

G2ST: a novel method to transform GML to SVG

Processing in-route nearest neighbor queries: a comparison of alternative approaches

Content Provider	ACM Digital Library
Author	Yoo, Jin Soung Shekhar, Shashi
Abstract	Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., location-based services, advanced traveler information systems, etc. This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facility instance via which the detour from the original route on the way to the destination is smallest. This paper addresses four alternative solution methods. Comparisons among them are presented using an experimental framework. Several experiments using real road map datasets are conducted to examine the behavior of the solutions in terms of three parameters affecting the performance. Our experiments show that the computation costs for all methods except the precomputed zone-based method increase with increases in the road map size and the query route length but decreases with increase in the facility density. The precomputed zone-based method shows the most efficiency when there are no updates on the road map.
Starting Page	9
Ending Page	16
Page Count	8
File Format	PDF
ISBN	1581137303
DOI	10.1145/956676.956678
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-11-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Nearest neighborhood query Advanced traveler information systems Location-based services Road network Route
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Adaptive nearest neighbor queries in travel time networks

Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches (2003)

Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches (2003)

In-Route Nearest Neighbor Queries

Nearest neighbor queries in road networks

In-route nearest neighbor queries (2004).

Abstract In-Route Nearest Neighbor Queries

k-Nearest neighbor query processing method based on distance relation pattern

The multi-rule partial sequenced route query

Processing in-route nearest neighbor queries: a comparison of alternative approaches

Similar Documents

Adaptive nearest neighbor queries in travel time networks

Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches (2003)

Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches (2003)

In-Route Nearest Neighbor Queries

Nearest neighbor queries in road networks

In-route nearest neighbor queries (2004).

Abstract In-Route Nearest Neighbor Queries

k-Nearest neighbor query processing method based on distance relation pattern

The multi-rule partial sequenced route query

Processing in-route nearest neighbor queries: a comparison of alternative approaches