161 search results - page 2 / 33 » Effective Top-k Keyword Search in Relational Databases Consi... |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
EDBT
2010
ACM
13 years 7 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
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...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...