Keyword Search in Databases: The Power of RDBMS

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of ACM Conference on Management of Data, 2009, pp. 681 - 694
Issue Date:
2009-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013002379OK.pdf514.69 kB
Adobe PDF
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMS. In brief, it finds how the tuples containing the given keywords are connected via sequences of connections (foreign key references) among tuples in an RDB. Such interconnected tuple structures can be found as connected trees up to a certain size, sets of tuples that are reachable from a root tuple within a radius, or even multi-center subgraphs within a radius. In the literature, there are two main approaches. One is to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. Due to a large number of relational algebra expressions needed to process, most of the existing works take a middleware approach without fully utilizing RDBMSs. The other is to materialize an RDB as a graph and find the interconnected tuple structures using graph-based algorithms in memory
Please use this identifier to cite or link to this item: