Sciweavers

89 search results - page 2 / 18
» Efficient Continuous Top-k Keyword Search in Relational Data...
Sort
View
WAIM
2010
Springer
13 years 4 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 7 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 7 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
SIGMOD
2010
ACM
199views Database» more  SIGMOD 2010»
13 years 4 months ago
Keyword search across databases and documents
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
Carlos Garcia-Alvarado, Carlos Ordonez
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 7 months ago
Progressive Keyword Search in Relational Databases
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...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...