ACM Home Page
Please provide us with feedback. Feedback
Efficient type-ahead search on relational data: a TASTIER approach
Full text PdfPdf (872 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 18: keyword search table of contents
Pages 695-706  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Guoliang Li  Tsinghua University, Beijing, China
Shengyue Ji  University of California, Irvine, Irvine, California, USA
Chen Li  University of California, Irvine, Irvine, California, USA
Jianhua Feng  Tsinghua University, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 42,   Downloads (12 Months): 187,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559918
What is a DOI?

ABSTRACT

Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have limited knowledge about the data, and have to use a try-and-see approach for modifying queries and finding answers. In this paper we propose a novel approach to keyword search in the relational world, called Tastier. A Tastier system can bring instant gratification to users by supporting type-ahead search, which finds answers "on the fly" as the user types in query keywords. A main challenge is how to achieve a high interactive speed for large amounts of data in multiple tables, so that a query can be answered efficiently within milliseconds. We propose efficient index structures and algorithms for finding relevant answers on-the-fly by joining tuples in the database. We devise a partition-based method to improve query performance by grouping highly relevant tuples and pruning irrelevant tuples efficiently. We also develop a technique to answer a query efficiently by predicting the highly relevant complete queries for the user. We have conducted a thorough experimental evaluation of the proposed techniques on real data sets to demonstrate the efficiency and practicality of this new search paradigm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
4
 
5
H. Bast and I. Weber. The completesearch engine: Interactive, efficient, and towards ir&db integration. In CIDR pages 88--95, 2007.
 
6
7
 
8
 
9
B. D. Davison and H. Hirsh. Predicting sequences of user actions. In AAAI/ICML Workshop on Predicting the Future 1998.
 
10
B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding top-k min-cost connected trees in databases. In ICDE pages 836--845, 2007.
11
12
13
 
14
 
15
16
 
17
 
18
19
20
21
22
 
23
 
24
25
26
27
 
28
 
29
 
30
31
32
33
34


Collaborative Colleagues:
Guoliang Li: colleagues
Shengyue Ji: colleagues
Chen Li: colleagues
Jianhua Feng: colleagues