Collective keyword search on spatial network databases

Yanhong Li, Guohui Li, Lih-Chyun Shu

Research output: Contribution to journalArticle

Abstract

Spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects, have received a growing number of attention in real life. However, most of the existing SKQ methods are either focused on finding individual objects that each satisfy a query requirement or limited in Euclidean space. The paper takes the first step to address the issue of processing Collective Spatial Keyword Queries in Road Networks (CoSKQRN). Two efficient algorithms called AppM and OptM are proposed. In particular, AppM method is used to get the approximate result set with a relatively low cost, and OptM is to get the optimal query result set with a reasonable cost. Finally, simulation experiments on a real road network and a geo-textual dataset are conducted to demonstrate the performance of our proposed algorithms.

Original languageEnglish
Pages (from-to)5489-5497
Number of pages9
JournalJournal of Computational Information Systems
Volume11
Issue number15
DOIs
Publication statusPublished - 2015 Aug 1

Fingerprint

Costs
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications

Cite this

@article{24340263b8a44dd6b7bbed758a2e3637,
title = "Collective keyword search on spatial network databases",
abstract = "Spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects, have received a growing number of attention in real life. However, most of the existing SKQ methods are either focused on finding individual objects that each satisfy a query requirement or limited in Euclidean space. The paper takes the first step to address the issue of processing Collective Spatial Keyword Queries in Road Networks (CoSKQRN). Two efficient algorithms called AppM and OptM are proposed. In particular, AppM method is used to get the approximate result set with a relatively low cost, and OptM is to get the optimal query result set with a reasonable cost. Finally, simulation experiments on a real road network and a geo-textual dataset are conducted to demonstrate the performance of our proposed algorithms.",
author = "Yanhong Li and Guohui Li and Lih-Chyun Shu",
year = "2015",
month = "8",
day = "1",
doi = "10.12733/jcis14944",
language = "English",
volume = "11",
pages = "5489--5497",
journal = "Journal of Computational Information Systems",
issn = "1553-9105",
publisher = "Binary Information Press",
number = "15",

}

Collective keyword search on spatial network databases. / Li, Yanhong; Li, Guohui; Shu, Lih-Chyun.

In: Journal of Computational Information Systems, Vol. 11, No. 15, 01.08.2015, p. 5489-5497.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Collective keyword search on spatial network databases

AU - Li, Yanhong

AU - Li, Guohui

AU - Shu, Lih-Chyun

PY - 2015/8/1

Y1 - 2015/8/1

N2 - Spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects, have received a growing number of attention in real life. However, most of the existing SKQ methods are either focused on finding individual objects that each satisfy a query requirement or limited in Euclidean space. The paper takes the first step to address the issue of processing Collective Spatial Keyword Queries in Road Networks (CoSKQRN). Two efficient algorithms called AppM and OptM are proposed. In particular, AppM method is used to get the approximate result set with a relatively low cost, and OptM is to get the optimal query result set with a reasonable cost. Finally, simulation experiments on a real road network and a geo-textual dataset are conducted to demonstrate the performance of our proposed algorithms.

AB - Spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects, have received a growing number of attention in real life. However, most of the existing SKQ methods are either focused on finding individual objects that each satisfy a query requirement or limited in Euclidean space. The paper takes the first step to address the issue of processing Collective Spatial Keyword Queries in Road Networks (CoSKQRN). Two efficient algorithms called AppM and OptM are proposed. In particular, AppM method is used to get the approximate result set with a relatively low cost, and OptM is to get the optimal query result set with a reasonable cost. Finally, simulation experiments on a real road network and a geo-textual dataset are conducted to demonstrate the performance of our proposed algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84950301675&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84950301675&partnerID=8YFLogxK

U2 - 10.12733/jcis14944

DO - 10.12733/jcis14944

M3 - Article

AN - SCOPUS:84950301675

VL - 11

SP - 5489

EP - 5497

JO - Journal of Computational Information Systems

JF - Journal of Computational Information Systems

SN - 1553-9105

IS - 15

ER -