TITLE

Restricted Continuous KNN Queries on Road Networks with Caching Enhancement

AUTHOR(S)
Safar, Maytham; Ebrahimi, Dariush; Jane F., Mary Magdalene; Nadarajan, R.
PUB. DATE
February 2008
SOURCE
Journal of Digital Information Management;Feb2008, Vol. 6 Issue 1, p38
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined paths (e.g., roads) that are specified by an underlying network. In our previous work, we proposed a novel approach, termed Progressive Incremental Network Expansion (PINE), to efficiently support several spatial queries. In this work, we utilize our developed PINE system to efficiently support Restricted Continuous K Nearest Neighbors (RCKNNs) queries. RCKNN continuously finds the K nearest objects to a query point on a given path that are within a specified distance bound. Our solution addresses a new type of query that is plausible to many applications where the answer to the query not only depends on the distances of the nearest neighbors, but also on the user or application needs. By distinguishing between two types of split points, we reduce the number of computations required to retrieve the RCKNNs of a moving object. We further define a caching model to expedite RCKNN query response time.
ACCESSION #
31266606

 

Related Articles

  • Editing and versioning for high performance network models in a multiuser environment. Bakalov, Petko; Hoel, Erik; Heng, Wee-Liang; Menon, Sudhakar; Tsotras, Vassilis // GeoInformatica;Oct2011, Vol. 15 Issue 4, p769 

    Network data models are frequently used as a mechanism to describe the connectivity between spatial features in GIS applications. Real-life network models are dynamic in nature since spatial features can be periodically modified to reflect changes in the real world objects that they model. Such...

  • SYNCHRONIZATION AND REPLICATION OF GEODATA IN THE ESRI PLATFORM. Pohanka, Tomas; Pechanec, Vilem; Solanska, Marketa // Proceedings of the International Multidisciplinary Scientific Ge;2015, Vol. 4, p837 

    The main goal of this article is to evaluate options of replication solutions that are available and based on this research design a database solution that considers possibilities and requirements of the Department of Geoinformatics at Palacky University in Olomouc. In the theoretical part terms...

  • Definition of the Constraint with Spatial Characters. Ju, Shiguang; Gu, Yi; Tang, Zhu; Chen, Weihe // International Journal of Distributed Sensor Networks;Jan/Feb2009, Vol. 5 Issue 1, p51 

    With the development of the RBAC applications, the spatial characters of those protected data objects have to be considered in many fields. In most cases, the permissions of the same user's access will be changed when the users' location changed. The roles played by the same user may be...

  • Pervasive Spatial Information Management. Sonnen, David // Geospatial Solutions;Jan2006, Vol. 16 Issue 1, p20 

    The article reports developments in the spatial information management (SIM) industry in the U.S. The industry has transformed itself from a specialist application to a technology that has broad relevance in many information technology. The transformation includes a multidimensional shift in...

  • Integration of Bio-Geo spatial database for selected watersheds in Himalayan region. Gosain, A. K.; Rao, Sandhya; Singh, Puja; Arora, Anamika // Current Science (00113891);1/25/2010, Vol. 98 Issue 2, p183 

    An integrated database has been designed to cater to the data collected by different agencies on various aspects of biological and geophysical data, as part of the coordinated programme on 'Bio-Geo database and ecological modeling for Himalayas' initiated by NRDMS division of the Department of...

  • PRACTICAL APPLICATION OF GIS IN KOSOVO, APPLICATION STRATEGY. Isufi, Florim; Bulliqi, Shpejtim; Isufi, Ardian // Proceedings of the International Multidisciplinary Scientific Ge;2015, Vol. 4, p773 

    During the last 30 years we have seen a lot of initiatives for implementation of information management, especially for spatial data this will be geographic information systems. As a useful system for a lot of activities wide number of institution, agencies and companies started using geographic...

  • The Key Technology Research of Spatial Data Crawl Based on Web. AN Dezhi; WU Guangli; LU Jun // Applied Mechanics & Materials;2014, Issue 651-653, p1988 

    With the rapid development of Web technology, provides abundant information for people, at the same time bring a lot of information redundancy. How to quickly locate the user requirements, is currently one of the common problems in the network retrieval, especially in the field of space...

  • About 1Spatial.  // Worldwide Databases;Sep2011, Vol. 23 Issue 9, p5 

    The article offers information on 1Spatial, a company that provides operational solutions to organizations with large spatial databases.

  • Clustering Large Spatial Data with Local-density and its Application. Guiyi Wei; Haiping Liu; Mande Xie // Information Technology Journal;2009, Vol. 8 Issue 4, p476 

    In this study, a new algorithm LD-BSCA is proposed with introducing the concept of local MinPts (a minimum number of points) and the new cluster expanding condition: ExpandConC1Id (Expanding Condition of C1Id-th Cluster). We minimize the algorithm input down to only one parameter and let the...

  • An Efficient Density based Improved K- Medoids Clustering algorithm. Devi, J Rama; Rao, K Nageswara; A, Raghuvira Pratap; Vani, K Suvarna // International Journal of Advanced Computer Science & Application;Jun2011, Vol. 2 Issue 6, p49 

    Clustering is the process of classifying objects into different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-medoids and k-medoids. However conventional k-medoids clustering algorithm suffers from many...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics