Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees
Keyword queries are extremely easy for a user to write. They have become a standard way to query for information in web search engines and most other information retrieval systems whose users are usually laypersons and might not have knowledge about the database schema or contained data. As keyword...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3137 |