552 search results - page 54 / 111 » On the Complexity of Join Predicates |
206
click to vote
ICDE
2007
IEEE
16 years 1 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 ...
195
Voted
ICDT
2009
ACM
16 years 1 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...
91
Voted
PODC
2009
ACM
16 years 1 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...
86
Voted
SIGMOD
2003
ACM
16 years 21 days 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...
111
Voted
ADBIS
2006
Springer
15 years 6 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. ...