613 search results - page 43 / 123 » Query Evaluation on a Database Given by a Random Graph |
152
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
115
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale . In this context, view de nitions are very large and there is no appa...
129
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
130
Voted
DKE
2002
15 years 3 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
145
Voted
LAWEB
2003
IEEE
15 years 9 months ago
2003
IEEE
RDF is the first W3C standard for enriching information resources of the Web with detailed meta data. The semantics of RDF data is defined using a RDF schema. The most expressiv...