Keyword search on temporal graphs
Document Type
Conference Proceeding
Publication Date
10-24-2018
Abstract
Archiving graph data over history is demanded in many applications, such as social network and bibliographies. Typically, people are interested in querying temporal graphs. Existing keyword search approaches for graph-structured data are insufficient for querying temporal graphs. This paper initiates the study of supporting keyword-based queries on temporal graphs. We propose a search syntax that is an extension of keyword search, which allows casual users to easily search temporal graphs with temporal predicates and ranking functions. To generate results efficiently, we propose a best path iterator, which finds the 'best' paths between two data nodes in each snapshot regarding to three ranking factors. We develop algorithms that efficiently generate top-k query results. Extensive experiments verified the efficiency and effectiveness of our approach.
Identifier
85057072305 (Scopus)
ISBN
[9781538655207]
Publication Title
Proceedings IEEE 34th International Conference on Data Engineering Icde 2018
External Full Text Location
https://doi.org/10.1109/ICDE.2018.00261
First Page
1807
Last Page
1808
Grant
IIS-1322406
Fund Ref
National Science Foundation
Recommended Citation
Liu, Ziyang; Wang, Chong; and Chen, Yi, "Keyword search on temporal graphs" (2018). Faculty Publications. 8312.
https://digitalcommons.njit.edu/fac_pubs/8312