PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
暂无分享,去创建一个
[1] Elke A. Rundensteiner,et al. Run-time operator state spilling for memory intensive long-running queries , 2006, SIGMOD Conference.
[2] Goetz Graefe,et al. Query evaluation techniques for large databases , 1993, CSUR.
[3] Alon Y. Halevy,et al. An adaptive query execution system for data integration , 1999, SIGMOD '99.
[4] Ghaleb Abdulla,et al. Simulation data as data streams , 2004, SGMD.
[5] A. N. Wilschut,et al. Dataflow query execution in a parallel main-memory environment , 1991, Distributed and Parallel Databases.
[6] Yufei Tao,et al. RPJ: producing fast join results on streams through rate-based optimization , 2005, SIGMOD '05.
[7] Jeffrey F. Naughton,et al. Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources , 2003, VLDB.
[8] Walid G. Aref,et al. Hash-merge join: a non-blocking join algorithm for producing fast and early join results , 2004, Proceedings. 20th International Conference on Data Engineering.
[9] Jeffrey F. Naughton,et al. A scalable hash ripple join algorithm , 2002, SIGMOD '02.
[10] Leonard D. Shapiro,et al. Join processing in database systems with large main memories , 1986, TODS.