Finding the sites with best accessibilities to amenities

Qianlu Lin; Chuan Xiao; Muhammad Aamir Cheema; Wei Wang

doi:10.1007/978-3-642-20152-3_5

Finding the sites with best accessibilities to amenities

Qianlu Lin^*, Chuan Xiao, Muhammad Aamir Cheema, Wei Wang

^*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

6 Citations (Scopus)

Abstract

Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites R with the best accessibilities. Two R-tree based algorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.

Original language	English
Title of host publication	Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings
Pages	58-72
Number of pages	15
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-20152-3_5
Publication status	Published - 2011
Externally published	Yes
Event	16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 - Hong Kong, China Duration: 22 Apr 2011 → 25 Apr 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	6588 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th International Conference on Database Systems for Advanced Applications, DASFAA 2011
Country/Territory	China
City	Hong Kong
Period	22/04/11 → 25/04/11

Access to Document

10.1007/978-3-642-20152-3_5

Cite this

Lin, Q., Xiao, C., Cheema, M. A., & Wang, W. (2011). Finding the sites with best accessibilities to amenities. In Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings (PART 2 ed., pp. 58-72). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6588 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-20152-3_5

Lin, Qianlu ; Xiao, Chuan ; Cheema, Muhammad Aamir et al. / Finding the sites with best accessibilities to amenities. Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings. PART 2. ed. 2011. pp. 58-72 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{2ae2443bd30d47e1b778616ef54ccefe,

title = "Finding the sites with best accessibilities to amenities",

abstract = "Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites R with the best accessibilities. Two R-tree based algorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.",

author = "Qianlu Lin and Chuan Xiao and Cheema, \{Muhammad Aamir\} and Wei Wang",

year = "2011",

doi = "10.1007/978-3-642-20152-3\_5",

language = "English",

isbn = "9783642201516",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "58--72",

booktitle = "Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings",

edition = "PART 2",

note = "16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 ; Conference date: 22-04-2011 Through 25-04-2011",

}

Lin, Q, Xiao, C, Cheema, MA & Wang, W 2011, Finding the sites with best accessibilities to amenities. in Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6588 LNCS, pp. 58-72, 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011, Hong Kong, China, 22/04/11. https://doi.org/10.1007/978-3-642-20152-3_5

Finding the sites with best accessibilities to amenities. / Lin, Qianlu; Xiao, Chuan; Cheema, Muhammad Aamir et al.
Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings. PART 2. ed. 2011. p. 58-72 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6588 LNCS, No. PART 2).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Finding the sites with best accessibilities to amenities

AU - Lin, Qianlu

AU - Xiao, Chuan

AU - Cheema, Muhammad Aamir

AU - Wang, Wei

PY - 2011

Y1 - 2011

N2 - Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites R with the best accessibilities. Two R-tree based algorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.

AB - Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites R with the best accessibilities. Two R-tree based algorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.

UR - https://www.scopus.com/pages/publications/79955099129

U2 - 10.1007/978-3-642-20152-3_5

DO - 10.1007/978-3-642-20152-3_5

M3 - Conference Paper published in a book

AN - SCOPUS:79955099129

SN - 9783642201516

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 58

EP - 72

BT - Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings

T2 - 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011

Y2 - 22 April 2011 through 25 April 2011

ER -

Lin Q, Xiao C, Cheema MA, Wang W. Finding the sites with best accessibilities to amenities. In Database Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings. PART 2 ed. 2011. p. 58-72. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-642-20152-3_5

Finding the sites with best accessibilities to amenities

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this