Cascade Graphs: Design, Analysis and Algorithms for Relational Joins

Published Online:https://doi.org/10.1287/ijoc.13.1.2.9746

References

  • Ahn I., Snodgrass R. T.Performance analysis of a temporal database management system (1986) Proceedings of ACM SIGMOD(Washington, D.C.)96–107Google Scholar
  • Blasgen M. W., Eswaran K. P. Storage and access in relational databases. IBM Systems Journal (1977) 16:363–377CrossrefGoogle Scholar
  • Chaudhuri S., Dayal U. An overview of data warehousing and OLAP technology. SIGMOD Record (1997) 26:507–508CrossrefGoogle Scholar
  • DeWitt D. J., Katz R. H., Olken F., Shapiro L. D., Stonebraker M. R., Wood D.Implementation techniques for main memory database systems (1984) Proceedings of ACM SIGMOD(Boston, MA)1–8CrossrefGoogle Scholar
  • El_Masri R., Navathe S. B.Fundamentals of Database Systems (1989) (Benjamin/Cummings, Menlo Park, CA) Google Scholar
  • Gopal R. D., Ramesh R., Zionts S. Access path optimization in relational joins. ORSA J. Computing (1995) 7:257–268LinkGoogle Scholar
  • Gotlieb C. C., Tompa F. W. Choosing a storage schema. Acta Informatica (1973) 3:57–68Google Scholar
  • Gotlieb L. R. Computing joins of relations. ACM-SIGMOD International Conference on Management of Data (1975) (ACM, New York) 55–63CrossrefGoogle Scholar
  • Goyal P., Li H. F., Regener E., Sadri F.Scheduling of page fetches in join operations using Bc-trees (1988) Proceedings of the 4th International Conference on Data Engineering(Los Angeles, CA)304–310CrossrefGoogle Scholar
  • Gray J., Putzolu G. F.The five-minute rule for trading memory for disc accesses, and the 10 byte rule for trading memory for CPU time (1987) Proceedings of ACM SIGMOD(Chicago, Illinois)395–398Google Scholar
  • Kryder M. Data storage in 2000 - trends in data storage technologies. IEEE Transactions on Magnetics (1989) 25:4358–4363CrossrefGoogle Scholar
  • Lo M., Ravishankar C. V. Spatial hash-joins. SIGMOD Record (1996) 247–258CrossrefGoogle Scholar
  • Mishra P., Eich M. H. Join processing in relational databases. ACM Computing Surveys (1992) 24:63–113CrossrefGoogle Scholar
  • Murphy M. C., Rotem D.Effective resource utilization for multiprocessor join execution (1989a) Proceedings of the Very Large Data Bases Conference(Amsterdam, Netherlands)67–76Google Scholar
  • Murphy M. C., Rotem D.Processor scheduling for multiprocessor joins (1989b) Proceedings of the 5th International Conference on Data Engineering(Los Angeles, CA)225–234CrossrefGoogle Scholar
  • Murphy M. C., Rotem D. Multiprocessor join scheduling. IEEE Transactions on Knowledge and Data Engineering (1993) 5:322–338CrossrefGoogle Scholar
  • O'Neil P., Graefe G. Multi-table joins through bitmapped join indices. SIGMOD Record (1995) 24:173–182CrossrefGoogle Scholar
  • O'Neil P., Quass D.Improved query performance with variant indexes (1997) Proceedings of the ACM SIGMOD Conference(Tucson, AZ)38–49CrossrefGoogle Scholar
  • Orenstein J.A comparison of spatial query processing techniques for native and parameter spaces (1990) Proceedings of the ACM SIGMOD Conference on Management of Data:343–352CrossrefGoogle Scholar
  • Ozsoyoglu G., Snodgrass R. T. Temporal and real-time databases: a survey. IEEE Transactions on Knowledge and Data Engineering (1995) 7:513–532CrossrefGoogle Scholar
  • Patel J. M., DeWitt D.Partition based spatial merge join (1996) Proceedings of the ACM SIGMOD Conference(Montreal, Canada)259–270CrossrefGoogle Scholar
  • Pramanik S., Ittner D. Use of graph-theoretic models for optimal relational database accesses to perform join. ACM Transactions on Database Systems (1985) 10:57–74CrossrefGoogle Scholar
  • Roussopoulos N. The logical access path schema for a database. IEEE Transactions on Software Engineering (1982) 6:563–573CrossrefGoogle Scholar
  • Roussopoulos N. An incremental access method for view-cache: concepts, algorithms, and cost analysis. ACM Transactions on Database Systems (1991) 16:535–563CrossrefGoogle Scholar
  • Roussopoulos N., Kotidis T., Roussopoulos M.Cubetree: organization of bulk updates on the data cube (1997) Proceedings of the ACM SIGMOD Conference(Tucson, AZ)89–99CrossrefGoogle Scholar
  • Severence D. G., Lohman G. M. Differential files: their applications to the maintainence of large databases. ACM Transactions on Database Systems (1976) 1:256–267CrossrefGoogle Scholar
  • Shapiro L. D. Join processing in database systems with large main memories. ACM Transactions on Database Systems (1986) 11:239–264CrossrefGoogle Scholar
  • Su S. Y. W.Principles, Architectures, and Techniques, Database Computers (1988) (McGraw Hill, New York) Google Scholar
  • Teorey T. J., Fry J. P. The Logical record access approach to database design. ACM Computing Surveys (1980) 12:197–222Google Scholar
  • Ullman J. D.Principles of Database and Knowledge-base Systems (1990) (Computer Science Press, Baltimore, MD) Google Scholar
  • Valduriez P. Optimization of complex database queries using join indices. Database Engineering (1986) 9:10–16Google Scholar
  • Valduriez P. Join indices. ACM Transactions on Database Systems (1987) 12:218–246CrossrefGoogle Scholar
  • Weiderhold G.File Organization for Database Design (1987) (McGraw-Hill, New York) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.