613 search results - page 45 / 123 » Query Evaluation on a Database Given by a Random Graph |
121
Voted
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
218
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
125
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
129
Voted
KBSE
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a novel approach for black-box testing of database management systems (DBMS) using the Alloy tool-set. Given a database schema and an SQL query as inputs, our approach ...
148
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...