TargetSearch: A ranking friendly XML keyword search engine

Ziyang Liu; Yichuan Cai; Yi Chen

doi:10.1109/ICDE.2010.5447880

TargetSearch: A ranking friendly XML keyword search engine

Ziyang Liu, Yichuan Cai, Yi Chen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

Abstract

This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query results properly so that they can be effectively ranked and easily digested by users. The approaches adopted in the literature generate either overwhelmingly large results or fragmentary results, both of which may cause the ranking schemes to be ineffective. Intuitively, each query has a search target and each result should contain exactly one instance of the search target along with its evidence. We developed TargetSearch which composes atomic and intact query results driven by users' search targets.

Original language	English (US)
Title of host publication	26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings
Pages	1101-1104
Number of pages	4
DOIs	https://doi.org/10.1109/ICDE.2010.5447880
State	Published - 2010
Externally published	Yes
Event	26th IEEE International Conference on Data Engineering, ICDE 2010 - Long Beach, CA, United States Duration: Mar 1 2010 → Mar 6 2010

Publication series

Name	Proceedings - International Conference on Data Engineering
ISSN (Print)	1084-4627

Other

Other	26th IEEE International Conference on Data Engineering, ICDE 2010
Country/Territory	United States
City	Long Beach, CA
Period	3/1/10 → 3/6/10

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Information Systems

Access to Document

10.1109/ICDE.2010.5447880

Cite this

@inproceedings{6fbcac9a28344a85ac559047cb80dfdd,

title = "TargetSearch: A ranking friendly XML keyword search engine",

abstract = "This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query results properly so that they can be effectively ranked and easily digested by users. The approaches adopted in the literature generate either overwhelmingly large results or fragmentary results, both of which may cause the ranking schemes to be ineffective. Intuitively, each query has a search target and each result should contain exactly one instance of the search target along with its evidence. We developed TargetSearch which composes atomic and intact query results driven by users' search targets.",

author = "Ziyang Liu and Yichuan Cai and Yi Chen",

year = "2010",

doi = "10.1109/ICDE.2010.5447880",

language = "English (US)",

isbn = "9781424454440",

series = "Proceedings - International Conference on Data Engineering",

pages = "1101--1104",

booktitle = "26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings",

}

Liu, Z, Cai, Y & Chen, Y 2010, TargetSearch: A ranking friendly XML keyword search engine. in 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings., 5447880, Proceedings - International Conference on Data Engineering, pp. 1101-1104, 26th IEEE International Conference on Data Engineering, ICDE 2010, Long Beach, CA, United States, 3/1/10. https://doi.org/10.1109/ICDE.2010.5447880

TY - GEN

T1 - TargetSearch

T2 - 26th IEEE International Conference on Data Engineering, ICDE 2010

AU - Liu, Ziyang

AU - Cai, Yichuan

AU - Chen, Yi

PY - 2010

Y1 - 2010

N2 - This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query results properly so that they can be effectively ranked and easily digested by users. The approaches adopted in the literature generate either overwhelmingly large results or fragmentary results, both of which may cause the ranking schemes to be ineffective. Intuitively, each query has a search target and each result should contain exactly one instance of the search target along with its evidence. We developed TargetSearch which composes atomic and intact query results driven by users' search targets.

AB - This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query results properly so that they can be effectively ranked and easily digested by users. The approaches adopted in the literature generate either overwhelmingly large results or fragmentary results, both of which may cause the ranking schemes to be ineffective. Intuitively, each query has a search target and each result should contain exactly one instance of the search target along with its evidence. We developed TargetSearch which composes atomic and intact query results driven by users' search targets.

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

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

U2 - 10.1109/ICDE.2010.5447880

DO - 10.1109/ICDE.2010.5447880

M3 - Conference contribution

AN - SCOPUS:77952761973

SN - 9781424454440

T3 - Proceedings - International Conference on Data Engineering

SP - 1101

EP - 1104

BT - 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings

Y2 - 1 March 2010 through 6 March 2010

ER -

TargetSearch: A ranking friendly XML keyword search engine

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this