613 search results - page 84 / 123 » Query Evaluation on a Database Given by a Random Graph |
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
112
click to vote
SSDBM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial dat...
101
click to vote
DEXAW
2005
IEEE
15 years 1 months ago
2005
IEEE
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
130
click to vote
P2PKM
2004
15 years 1 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...