Abstract
Keyword search in relational databases has gained popularity due to its ease of use. However, existing methods do not handle keyword search in temporal databases. In this paper, we extend keyword queries to allow temporal information to be associated with keywords, as well as support temporal relationships between two keywords. We design a target-oriented search over an augmented data graph to efficiently evaluate such temporal keyword queries. Experiments on 3 datasets demonstrate the efficiency of the proposed approach to answer complex temporal keyword queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This dataset is not available due to patient confidentiality.
- 2.
- 3.
References
Agrawal, S., Chaudhuri, S., Das, G.: DBXPlorer: a system for keyword-based search over relational databases. In: IEEE ICDE (2002)
Allen, J.: Maintaining knowledge about temporal intervals. Commun. ACM 26, 832–843 (1983)
Bergamaschi, S., Domnori, E., Guerra, F., Trillo Lado, R., Velegrakis, Y.: Keyword search over relational databases: a metadata approach. In: ACM SIGMOD (2011)
Bergamaschi, S., Guerra, F., Interlandi, M., Trillo-Lado, R., Velegrakis, Y.: Quest: a keyword search system for relational data based on semantic and machine learning techniques. VLDB J. 6, 1222–1225 (2013)
Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: IEEE ICDE (2002)
Bin-Thalab, R., El-Tazi, N., El-Sharkawi, M.: TMIX: temporal model for indexing XML documents. In: International Conference on Computer Systems and Applications (2013)
Dignös, A., Böhlen, M., Gamper, J.: Overlap interval partition join. In: ACM SIGMOD (2014)
Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in database. In: IEEE ICDE (2007)
He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: ACM SIGMOD (2007)
Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB (2003)
Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. In: VLDB (2002)
Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB (2005)
Kulkarni, K., Michels, J.: Temporal features in SQL:2011. SIGMOD Rec. 41, 34–43 (2012)
Li, G., Ooi, B., Feng, J., Wang, J., Zhou, L.: EASE: efficient and adaptive keyword search on unstructured, semi-structured and structured data. In: ACM SIGMOD (2008)
Luo, Y., Lin, X., Wang, W., Zhou, X.: SPARK: top-k keyword query in relational databases. In: ACM SIGMOD (2007)
Manica, E., Dorneles, C., Galante, R.: Supporting temporal queries on XML keyword search engines. J. Inf. Data Manag. 1(3), 471 (2010)
Özsoyoğlu, G., Snodgrass, R.: Temporal and real-time databases: a survey. IEEE Trans. Knowl. Data Eng. 7(4), 513–532 (1995)
Sandeep, T., Guy, M.: SQAK: doing more with keywords. In: ACM SIGMOD (2008)
Zeng, Z., Bao, Z., Le, T., Lee, M., Ling, T.: ExpressQ: identifying keyword context and search target in relational keyword queries. In: CIKM (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jia, X., Hsu, W., Lee, M.L. (2016). Target-Oriented Keyword Search over Temporal Databases. In: Hartmann, S., Ma, H. (eds) Database and Expert Systems Applications. DEXA 2016. Lecture Notes in Computer Science(), vol 9827. Springer, Cham. https://doi.org/10.1007/978-3-319-44403-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-44403-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44402-4
Online ISBN: 978-3-319-44403-1
eBook Packages: Computer ScienceComputer Science (R0)