ITREKS: keyword search over relational database by indexing tuple relationship

Authors:
Jiang Zhan;Shan Wang
Affiliations:
School of Information, Renmin University of China, Beijing, P.R. China;Key Laboratory of Data Engineering and Knowledge Engineering, Beijing, P.R. China
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 6
Cited 1

Outerjoins as disjunctions

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
DTL's DataSpot: Database Exploration Using Plain Language

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
DBXplorer: A System for Keyword-Based Search over Relational Databases

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Discover: keyword search in relational databases

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient IR-style keyword search over relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Study on efficiency and effectiveness of KSORD

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Keyword-based search is well studied in the world of text documents and Internet search engines. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discussed ITREKS, a system that support efficient keyword-based search over relational database by indexing tuple relationship: A basic database tuple relationship, FDJT, is established in advance. Then a FDJT-Tuple-Index table is created, which records relationships between each tuple and FDJT. At query time, for each of keywords, system first finds tuples in every relation that contain it, using full text indexes offered by database management system. Then use FDJT-Tuple-Index table to find the joinable tuples contain all keywords in the query.