UvA-DARE (Digital Academic Repository) Scalable distributed data structures for database management Karlsson, S.J. Publication date 2000 Link to publication Citation for published version (APA): Karlsson, S. J. (2000). Scalable distributed data structures for database management. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:02 Oct 2021 Bibliography y [ATWH94]] H. Afsarmanesh, F. Tuijnman, M. Wiedijk, and L.O. Hertzberger.. The Implementation Architecture of PEER Federatedd Object Management System. Technical re- port,, Department of Computer Systems, University of Am- sterdam,, September 1994. http://carol.wins.uva.nl/ net- peer/peer/doc/unicom.ps. [AvdBF+92]] Peter M. G. Apers, Carel A. van den Berg, Jan Flokstra, Paull W. P. J. Grefen, Martin L. Kersten, and Annita N. Wilschut.. PRISMA /DB: A Parallel Main Memory Rela- tionall DBMS. IEEE Transactions on Knowledge and Data Engineering,Engineering, 4(1):541 554, February 1992. [BAC+90]] H. Boral, W. Alexander, L. Clay, G. Copeland, S. Danforth, M.. Franklin, B. Hart. M. Smith, and P. Valduriez. Prototyping Bubba,, A Highly Parallel Database System. IEEE Transac- tionstions on Knowledge and Data Engineering, 2(1):4 24, March 1990. [BCV91]] B. Bergsten, M. Couprie, and P. Valduriez. Prototyping DBS3, aa Shared-Memory Parallel Database System. In Proceedings ofof First International Conference on Parallel and Distributed InformationInformation Systems, pages 226 234, Miami Beach, Florida, Decemberr 1991. [BD83]] H. Boral and DeWitt. Database Machines: An Idea Whose Timee Has Passed? A Critique of the Future of Database Ma- chines.. In International Workshop on Database Machines, vol- umee 3, pages 166 187, Munich, 1983. [BDF+97]] D. Barbara, W. DuMouchel, C. Faloutsos, P.J. Haas, J.M.. Hellerstein, Y. Ioannidis, H.V. Jagadish, T. Johnson, R.. V. Poosala Ng, K.A. Ross, and K.C. Sevcik. The new jersey dataa reduction report. Bulletin of the IEEE Computer Soci- etyety Technical Committee on Data Engineering, 20(4):25 34, Septemberr 1997. 141 1 1422 BIBLIOGRAPHY [Ben75]] Jon Louis Bentley. Multidimensional binary search trees usedd for associative searching. Communications of the ACM, 18(9):5099 517, September 1975. [Ben79]] Jon L. Bentley. Multidimensional binary search trees in databasee applications. IEEE Transactions on Software En- gineering,gineering, SE-5(5):333 340, July 1979. [BK95]] Peter A. Boncz and Martin L. Kersten. Monet: An Impres- sionistt Sketch of an Advanced Database System. In Basque In- ternationalternational Workshop on Information Technology: Data Man- agementagement Systems, San Sebastian (Spain), July 1995. IEEE. [BKK96]] Peter A. Boncz, F. Kwakkel, and Martin L. Kersten. High Performancee Support for 00 Traversals in Monet. In British NationalNational Conference on Databases(BNCOD'96), 1996. [BM72]] Rudolf Bayer and Edward M. McCreight. Organization and Maintenancee of Large Ordered Indices. Acta Informatica, 1:1733 189, 1972. [BMK99]] P. A. Boncz, S. Manegold, and M. L. Kersten. Database Ar- chitecturee Optimized for the New Bottleneck: Memory Access. Inn Proceedings of the International Conference on Very Large DataData Bases (VLDB), Edinburgh, United Kingdom, September 1999.. To appear. [BQK96]] Peter A. Boncz, Wilko Quak, and Martin L. Kersten. Monet andd its Geographic Extensions: a Novel Approach to High Per- formancee GIS Processing. In Advances in Database Technology EDBT96,EDBT96, pages 147 166, Avignon, France, March 1996. Springer. [BRK98]] P. A. Boncz, T. Riihl, and F. Kwakkel. The Drill Down Bench- mark.. In Proceedings of the International Conference on Very LargeLarge Data Bases (VLDB), pages 628 632, New York, NY, Augustt 1998. [BWK98]] Peter A. Boncz, Annita N. Wilschut, and Martin L. Ker- sten.. Flattening an object algebra to provide performance. Inn IEEE 14th International Conference on Data Engineering, pagess 568 577, Orlando, FL, USA, February 1998. [CGK+90]] D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S.. Tsur, and C. Zaniolo. The LDL System Prototype. IEEE TransactionsTransactions on Knowledge and Data Engineering, 2(1):76 89,, March 1990. BIBLIOGRAPHY BIBLIOGRAPHY 143 3 [Cor88]] Teradata Corporation. DBC/1012 data base computer con- ceptss and facilities. Technical Report Teradata Document C02-001-05,, Teradata Corporation, 1988. [CRDHW74]] R. H. Canady, J. L. Rydery R. D. Harrisson, E. L. Ivie, and L.. A. Wehr. A back-end computer for data base management. CommunicationsCommunications of ACM, 17(10):572 582, October 1974. [Cul94]] D. Culler. NOW: Towards Everyday Supercomputing on a Networkk of Workstations. Technical report, EECS Technical Reportss UC Berkeley, 1994. [Day99]] Umeshwar Dayal. Industrial panel on data warehousing tech- nologies:: Experiences, challenges, and directions. In Mal- colmm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stan- leyy B. Zdonik, and Michael L. Brodie, editors, VLDB'99, Pro- ceedingsceedings of 25th International Conference on Very Large Data Bases,Bases, September 7-10, 1999, Edinburgh, Scotland, UK, page 725.. Morgan Kaufmann, 1999. [DECM98]] Amalia Duch, Vladimir Estivill-Castro, and Contrado Mar- tinez.. Randomized k-dimensional binary search trees. In Lec- tureture Notes in Computer Science, volume 1533, pages 199 208, Taejon,, Korea, December 1998. Springer. [Dev93]] R. Devine. Design and implementation of DDH: A distributed dynamicc hashing algorithm. In Procedings of the 4th Interna- tionaltional Conference on Foundations of Data Organization and AlgorithmsAlgorithms (FODO), 1993. [DG92]] David DeWitt and Jim Gray. Parallel Database Systems: The Futuree of High Performance Database Systems. Communica- tionstions of the ACM, 35(6):85 98, 1992. [DGG+86]] D. DeWitt, R. Gerber, G. Graefe, M. Heytens, K. Kumar, and M.. Muralikrishna. GAMMA: A high performance dataflow databasee machine. In Procedings of VLDB, August 1986. [Dou90]] B. Dougherty. Telco's Strategic Importance in Tandem's Suc- cess.. Industry Viewpoint, 1990. [Du84]] H. C. Du. Distributing a database for parallel processing is np-hard.. ACM SIGMOD Rec., 14(l):55-60, March 1984. [FBF77]] Jerome H. Friedman, Jon Louis Bentley, and Raphael Ari Finkel.. An algorithm for finding best matches in logarithmic expectedd time. ACM Transactions on Mathematical Software, 3(2):2099 226, September 1977. 144 4 BIBLIOGRAPHY BIBLIOGRAPHY [FBY92]] William B. Frakes and Ricardo Baeza-Yates, editors. Informa- tiontion Retrieval: Data Structures & Algorithms. Prentice Hall, 1992. [FJP90]] J. C. French, A. K. Jones, and J. L. Pfaltz. Summary of thee Final Report of the NSF Workshop on Scientific Database Management.. In SIGMOD Record, volume 19:4, pages 32 40, Decemberr 1990. [Fre87]] Michael Freeston. The BANG File: A New Kind of Grid File. Inn ACM SIGMOD: Special Interest Group on Management of DataData 1987, pages 260 269, San Fransisco, California, Decem- berr 1987. [FRS93]] G. Fahl, T. Risch, and M. Sköld. AMOS - An Architecture for Activee Mediators. In IEEE Transactions on Knowledge and DataData Engineering, Haifa, Israel, June 1993. [GBHC00]] Steven D. Gribble, Eric A. Brewer, Joseph M. Hellerstein, and Davidd Culler. Scalable, Distributed Data Structures for Inter- nett Service Construction. In OSDI 2000: Fourth Symposium onon Operating Systems Design and Implementation, 2000. [Har94]] Evan Philip Harris. Towards Optimal Storage Design for Effi- cientcient Query Processing in Relational Database Systems. Phd- thesiss tech report 94/31, University of Melbourne, Novem- ber/Mayy 1994. [HCS99]] Joe Hellerstein, Mike Carey, and Mike Stonebraker. Tele- graph:: A universal system for information. WEB, 1999. http://db.cs.berkeley.edu/telegraph/. [Hel97]] J.M. Hellerstein. Online processing redux. Bulletin of the IEEEIEEE Computer Society Technical Committee on Data Engi- neering,,neering,, 20(3):20 29, September 1997. [HKMT95]] M. Holsheimer, M. L. Kersten, H. Mannilla, and H. Toivonen. AA Perspective on Databases and Data Mining. In Knowledge DiscoveryDiscovery in Database^ö, Montreal, Canada, 1995. [HSW88]] Andreas Hutflesz, Hans-Werner Six, and Peter Widmayer. Globallyy Order Preserving Multidimensional Linear Hashing. Inn ICDE: Fourth International Conference on Data Engineer- ing,ing, pages 572 579, Los Angeles, California, 1988. [HSW89]] Andreas Henrich, Hans-Werner Six, and Peter Widmayer. Thee LSD tree: Spatial Access to Multidimensional Point and BIBLIOGRAPHY BIBLIOGRAPHY 145 5 Nonpointt Objects. In Fifteenth International Conference on VeryVery Large Data Bases, Amsterdam, The Netherlands, August 1989. [IC91]] Yannis E. Ioannidis and S. Christodoulakis. On the propa- gationn of errors in the size of join results. In International ConferenceConference on