Answer aggregation for keyword search over relational databases

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Buranasaksee U., Porkaew K., Supasitthimethee U.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2010

หน้าแรก: 477

หน้าสุดท้าย: 482

จำนวนหน้า: 6

ISBN: 9780769540429

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-77954347959&doi=10.1109%2fICCNT.2010.130&partnerID=40&md5=285f709f00d6962db2a3cd1da180510b

ภาษา: English-Great Britain (EN-GB)

ดูบนเว็บไซต์ของสำนักพิมพ์

บทคัดย่อ

with the amount of text data stored in relational databases growing rapidly, the need of the user to search such information is dramatically going up. Many existing approaches focus on finding a tuple matching a keyword query and return the result as a joining network of tuples of one or more tables. In this paper, we formulate an answer aggregation of keyword search over relational databases problem which merges related joining tuples from multiple tables to a single tuple to reduce redundancy in the results and improve the search quality. We developed an approach which exploits the tuple identity information for merging tuples rather than scanning throughout the results to find the common values. We further proposed a pruning algorithm which greatly reduces the number of redundant results after merging. We have conducted experiments extensively on two well-known databases (DBLP and IMDB). The experimental results show that the number of tuples in the results was dramatically reduced which noticeably improved the search quality while the merging time and the pruning time were relatively low when compared to the searching time. ฉ 2010 IEEE.

คำสำคัญ

Merging, Pruning, Relational databases