135 search results - page 13 / 27 » Answering aggregate keyword queries on relational databases ... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
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 ...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
VLDB
1991
ACM
13 years 11 months ago
1991
ACM
We propose a two-pha.se algorithm for physical database design. In phase one the algorithm, for each logical query, losesrules to determine characteristics of a physical design (s...
CIDR
2011
12 years 11 months ago
2011
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...