A scalable approach for index in generic location-aware rank query
by Utharn Buranasaksee
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 14, No. 1, 2021

Abstract: As location-aware information becomes more popular, many researchers have been proposed many effective approaches to solving the problem. In this work, we identify the shortcomings of the existing method from the LINQ framework as our baseline. After that, an efficient method called Multi-IRS is proposed to optimise the query search at runtime. Our analysis points out how optimisation could be done. Multi-IRS makes use of the improved algorithm that addresses numeric and textual attributes. After that, the sparse ordered set is proposed to reduce the index construction time. Finally, the external attribute-based IR-tree sort algorithm is proposed to solve the scalability issues. Throughout the extensive experiments, our proposed method significantly outperforms the baseline algorithm.

Online publication date: Mon, 04-Jan-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com