Adaptive Algorithms for Set Containment Joins

ACM Transactions on Database Systems

Volumn 28, Issue 1, 2003, Pages 56-99

  Melnik, Sergey ^a,b   Garcia Molina, Hector ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

DATA SETS; PARTITIONING ALGORITHMS;

ADAPTIVE ALGORITHMS; FUNCTIONS; PERSONNEL; PERSONNEL RATING;

QUERY LANGUAGES;

EID: 0348220548     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/762471.762474     Document Type: Article

References (11)

1. BÖHM, C. AND KRIEGEL, H.-P. 2000. Dynamically optimizing high-dimensional index structures. In Proceedings of Advances in Database Technology - EDBT 2000, 7th International Conference on Extending Database Technology (Konstanz, Germany, Mar. 27-31). C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, Eds. Lecture Notes in Computer Science, vol. 1777. Springer-Verlag, New York.
2. CAI, J.-Y., CHAKARAVARTHY, V. T., KAUSHIK, R., AND NAUGHTON, J. 2001. On the complexity of join predicates. In PODS'01, Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Santa Barbara, Calif., May 21-23). ACM Press.
3. FALOUTSOS, C. AND CHRISTODOULAKIS, S. 1984. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Inf. Syst. 2,4, 267-288.
4. GRAY, J., SUNDARESAN, P., ENGLERT, S., BACLAWSKI, K., AND WEINBERGER, P. J. 1994. Quickly generating billion-record synthetic databases. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (Minneapolis, Minn., May 24-27). R. T. Snodgrass and M. Winslett, Eds. ACM, New York, 243-252.
5. HELLERSTEIN, J. M., KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. H. 1997. On the analysis of indexing schemes. In PODS'97, Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Tucson, AZ., May 12-14). ACM, New York, 249-256.
6. HELMER, S. AND MOERKOTTE, G. 1997. Evaluation of main memory join algorithms for joins with set comparison join predicates. In VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases (Athens, Greece, Aug. 25-29). M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, Eds. Morgan Kaufmann, Reading, Mass., 386-395.
7. HIRAI, J., RAGHAVAN, S., GARCIA-MOLINA, H., AND PAEPCKE, A. 2000. Webbase: A repository of web pages. In WWW'00, Proceedings of the 9th International World Wide Web Conference. Computer Networks, vol. 33. Elsevier-North Holland, Amsterdam, The Netherlands.
8. ISHIKAWA, Y., KITAGAWA, H., AND OHBO, N. 1993. Evaluation of signature flies as set access facilities in oodbs. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (Washington, D.C., May 26-28). P. Buneman and S. Jajodia, Eds. ACM, New York, 247-256.
9. MELNIK, S. AND GARCIA-MOLINA, H. 2002. Divide-and-conquer algorithm for computing set containment joins. In Proceedings of Advances in Database Technology - EDBT 2002, 8th International Conference on Extending Database Technology (Prague, Czech Republic, Mar. 25-27). C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, and M. Jarke, Eds. Lecture Notes in Computer Science, vol. 2287. Springer-Verlag.
10. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (Montreal, Que, Canada, June 4-6). H. V. Jagadish and I. S. Mumick, Eds. ACM, New York, 259-270.
11. RAMASAMY, K., PATEL, J. M., NAUGHTON, J. F., AND KAUSHIK, R. 2000. Set containment joins: The good, the bad and the ugly. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases (Cairo, Egypt, Sept. 10-14). A. E. Abbadi, M. L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, and K.-Y. Whang, Eds. Morgan-Kaufmann, Reading, Mass. 351-362.