Sciweavers

1125 search results - page 55 / 225
» Query Answering in Inconsistent Databases
Sort
View
CIKM
2009
Springer
14 years 4 months ago
Structure-aware indexing for keyword search in databases
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...
Guoliang Li, Jianhua Feng, Jianyong Wang
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 10 months ago
Stretch 'n' shrink: resizing queries to user preferences
We present Stretch `n' Shrink, a query design framework that explicitly takes into account user preferences about the desired answer size, and subsequently modifies the query...
Chaitanya Mishra, Nick Koudas
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 11 months ago
Multiple Materialized View Selection for XPath Query Rewriting
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using ...
Byron Choi, Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer ...
CIKM
2006
Springer
14 years 1 months ago
Information retrieval from relational databases using semantic queries
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
Anand Ranganathan, Zhen Liu
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 1 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava