124 search results - page 10 / 25 » Fusion Queries over Internet Databases |
72
Voted
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
SEMWEB
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we benchmark three popular database representations of RDF/S schemata and data: (a) a schema-aware (i.e., one table per RDF/S class or property) with explic...
CCR
2006
14 years 11 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
APWEB
2004
Springer
15 years 5 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
229
Voted
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...