2080 search results - page 78 / 416 » Collections, Cardinalities, and Relations |
174
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
172
click to vote
WAIM
2005
Springer
15 years 11 months ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
152
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
181
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
171
click to vote
LACL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...