Crawling Hidden Objects with knn queries

Crawling Hidden Objects with knn queries
Author(s):
K. Anilkumar, G.ANJAN BABU
Keywords:
Hidden Databases, Data Crawling, Location Based Services, kNN Queries
Abstract
ManywebsitesofferingLocationBasedServices(LBS)providea Knnsearchinterfacethatreturnsthetop-k nearestneighbor objects (e.g., nearest restaurants) for a given query location. This paper addresses the problem of crawling all objects efﬁciently from an LBS website, through the public kNN web search interface it provides. Speciﬁcally, we develop crawling algorithm for 2D and higher-dimensional spaces, respectively, and demonstrate through theoretical analysis that the overhead of our algorithms can be bounded by a function of the number of dimensions and the number of crawled objects, regardless of the underlying distributions of the objects. We also extend the algorithms to leverage scenarios where certain auxiliary information about the underlying data distribution, e.g., the population density of an area which is often positively correlated with the density of LBS objects, is available. Extensive experiments on real-world datasets demonstrate the superiority of our algorithms over the state-of-the-art competitors in the literature.
Article Details
Unique Paper ID: 145746 Publication Volume & Issue: Volume 4, Issue 11 Page(s): 160 - 170
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org