2229 search results - page 128 / 446 » The Case for Grounding Databases |
149
click to vote
FQAS
2006
Springer
15 years 9 months ago
2006
Springer
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
136
click to vote
DEXAW
2010
IEEE
15 years 6 months ago
2010
IEEE
In many cases keywords from a restricted set of possible keywords have to be assigned to texts. A common way to find the best keywords is to rank terms occurring in the text accord...
165
click to vote
DATESO
2010
15 years 3 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
130
click to vote
EDBT
2010
ACM
16 years 8 days ago
2010
ACM
Relational databases are periodically vacuumed to remove tuples that have expired. During the discovery phase of litigation, plaintiffs ask defendants for access to information re...
133
click to vote
APCCM
2008
15 years 7 months ago
2008
We identify established tableaux techniques as an invaluable tool for semantic knowledge acquisition in the design process of relational databases. Sample databases allow users an...