Analyzing Temporal Keyword Queries for Interactive Search over Temporal Databases

Querying temporal relational databases is a challenge for non-expert database users, since it requires users to understand the semantics of the database and apply temporal joins as well as temporal conditions correctly in SQL statements. Traditional keyword search approaches are not directly applicable to temporal relational databases since they treat time-related keywords as tuple values and do not consider the temporal joins between relations, which leads to missing answers, incorrect answers and missing query interpretations. In this work, we extend keyword queries to allow the temporal predicates, and design a schema graph approach based on the Object-Relationship-Attribute (ORA) semantics. This approach enables us to identify temporal attributes of objects/relationships and infer the target temporal data of temporal predicates, thus improving the completeness and correctness of temporal keyword search and capturing the various possible interpretations of temporal keyword queries. We also propose a two-level ranking scheme for the different interpretations of a temporal query, and develop a prototype system to support interactive keyword search.

[1]  Xiaohui Yu,et al.  CI-Rank: Ranking Keyword Search Results Based on Collective Importance , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[2]  Xuemin Lin,et al.  SPARK2: Top-k Keyword Query in Relational Databases , 2007, IEEE Transactions on Knowledge and Data Engineering.

[3]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[4]  Vagelis Hristidis,et al.  DISCOVER: Keyword Search in Relational Databases , 2002, VLDB.

[5]  Xiaohui Yu,et al.  Meaningful keyword search in relational databases with large and complex schema , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[6]  H. Gunadhi,et al.  Query processing algorithms for temporal intersection joins , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[7]  Tok Wang Ling,et al.  ExpressQ: Identifying Keyword Context and Search Target in Relational Keyword Queries , 2014, CIKM.

[8]  Jeffrey Xu Yu,et al.  Keyword search in databases: the power of RDBMS , 2009, SIGMOD Conference.

[9]  Shan Wang,et al.  Finding Top-k Min-Cost Connected Trees in Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[10]  Chong Wang,et al.  Keyword Search on Temporal Graphs , 2017, IEEE Transactions on Knowledge and Data Engineering.

[11]  Mong-Li Lee,et al.  Target-Oriented Keyword Search over Temporal Databases , 2016, DEXA.

[12]  Clement T. Yu,et al.  Effective keyword search in relational databases , 2006, SIGMOD Conference.

[13]  S. Sudarshan,et al.  Bidirectional Expansion For Keyword Search on Graph Databases , 2005, VLDB.

[14]  Tok Wang Ling,et al.  A Semantic Approach to Keyword Search over Relational Databases , 2013, ER.

[15]  Surajit Chaudhuri,et al.  DBXplorer: a system for keyword-based search over relational databases , 2002, Proceedings 18th International Conference on Data Engineering.

[16]  Edleno Silva de Moura,et al.  Ranking Candidate Networks of relations to improve keyword search over relational databases , 2015, ICDE.

[17]  S. Sudarshan,et al.  Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.

[18]  Vagelis Hristidis,et al.  Authority-based keyword search in databases , 2008, TODS.