552 search results - page 107 / 111 » On the Complexity of Join Predicates |
INFOCOM
2006
IEEE
14 years 9 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
SIGECOM
2006
ACM
14 years 6 days ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
MMDB
2003
ACM
13 years 11 months ago
2003
ACM
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
AC
2003
Springer
13 years 11 months ago
2003
Springer
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...