613 search results - page 52 / 123 » Query Evaluation on a Database Given by a Random Graph |
107
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
136
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a sce...
166
Voted
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
155
Voted
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
140
Voted
ER
2008
Springer
15 years 5 months ago
2008
Springer
During data warehouse design, the designer frequently encounters the problem of choosing among different alternatives for the same design construct. The behavior of the chosen desi...