106 search results - page 1 / 22 » Reachability Indexes for Relational Keyword Search |
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
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...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
ER
2008
Springer
13 years 6 months ago
2008
Springer
The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational rel...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...