Distance Browsing Query Processing using Query Result Set 


Vol. 12,  No. 5, pp. 673-682, Oct.  2005
10.3745/KIPSTD.2005.12.5.673


PDF
  Abstract

Distance browsing queries, namely k-nearest neighbor queries, are the most important queries in spatial database applications, e.g., Geographic Information Systems(GISs). Recently, GIS applications trends to extend themselves toward wide multi-user environments such as the Web. Since many techniques for such queries, where Hjaltason and Samet's algorithm is the most efficient one, were optimized for only one query, we need to complement them suitable for multi-user environments. It can be a good approach that we store many individual query results in a cache, i.e., query result caching and reuse them in evaluating incoming queries, i.e., query result matching. In this paper, we propose a complementary Hjaltason and Samet's algorithm capable of reusing previous query results in a cache for answering distance browsing queries in multi-user GIS environments. Our experimental results confirm the efficiency of our approach.

  Statistics
  Cite this article

[IEEE Style]

D. J. Park, S. W. Park, T. S. Chung, S. W. Lee, "Distance Browsing Query Processing using Query Result Set," The KIPS Transactions:PartD, vol. 12, no. 5, pp. 673-682, 2005. DOI: 10.3745/KIPSTD.2005.12.5.673.

[ACM Style]

Dong Joo Park, Sang Won Park, Tae Sun Chung, and Sang Won Lee. 2005. Distance Browsing Query Processing using Query Result Set. The KIPS Transactions:PartD, 12, 5, (2005), 673-682. DOI: 10.3745/KIPSTD.2005.12.5.673.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals