552 search results - page 54 / 111 » On the Complexity of Join Predicates |
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
ADBIS
2006
Springer
14 years 4 months ago
2006
Springer
In many information systems, the databases that make up the system are distributed in different modules or branch offices according to the requirements of the business enterprise. ...