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): , 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 , 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 Management of Data. ACM-SIGMOD, June 1991. .

[IEE92]] IEEE. IEEE Standard for Scalable Coherent Interface (SCI). IEEE,, 1992. http://www.SCIzzL.com/.

[Jön99]] Henrik André Jönsson. Indexing time-series data using text indexingindexing methods. Licentiate Thesis No. 723, Department of Computerr Science and Information Science, Linköping Uni- versity,, 1999.

[Kar94]] Jonas S. Karlsson. An Implementation of Transaction Logging andd Recovery in a Main Memory Resident Database System. Master'ss thesis, Department of Computer Science and Infor- mationn Science, Linköping University, 1994.

[Kar97]] Jonas S Karlsson. A Scalable Data Structure for a Parallel DataData Server. Licentiate Thesis No. 609, Department of Com- puterr Science and Information Science, Linköping University, 1997. .

[Kar98]] Jonas S Karlsson. hQT*: A Scalable Distributed Data Struc- turee for High-Performance Spatial Accesses. In Katsumi Tanakaa and Shahram Ghandeharizadeh, editors, FODO'98: TheThe 5th International Conference on Foundations of Data Or- ganization,ganization, pages 37 46, Kobe, Japan, November 1998.

[KarOO]] J. S. Karlsson. Omega-storage: A Self Organizing Muli- attributee Storage Technique for Large Main Memories. In AustralasianAustralasian Database Conference, Canberra, Australia, Jan- uaryy 2000. IEEE Computer Society Press. Accepted for pub- lication. .

[KK97]] Jonas S Karlsson and Martin L. Kersten. Scalable Storage forr a DBMS using Transparent Distribution. Technical Re- portt INS-R9710, ISSN 1386-3681, CWI (The Dutch Centre forr Mathematics and Computer Science, 1997.

[KK98]] Jonas S Karlsson and Martin L. Kersten. Transparent Dis- tributionn in a Storage Manager. In The 1995 International ConferenceConference on Parallel and Distributed Processing Techniques 146 6 BIBLIOGRAPHY BIBLIOGRAPHY

andand Applications (PDPTA '98), Las Vegas, Nevada, USA, July 1998. .

[KK99]] Jonas S. Karlsson and Martin L. Kersten. An Exploration off the Omega-Storage Design Space. Unpublished Technical Report,, CWI, The Netherlands, 1999.

[KLR+94]] J. S. Karlsson, S. Larsson, T. Risch, M. Sköld, and M. Werner. AMOSAMOS User's Guide. CAELAB, IDA, IDA, Deptartment off Computer Science and Information Science, Linköping University,, Sweden, memo 94-01 edition, March 1994. http://www.ida.liu.se/labs/edslab/amos/amosdoc.html. .

[KLR96]] Jonas S Karlsson, Witold Litwin, and Tore Risch. LH*LH: A Scalablee High Performance Data Structure for Switched Multi- computers.. In Advances in Database Technology EDBT'96, pagess 573 591, Avignon, France, March 1996. Springer.

[Knu]] Donald E. Knuth. The Art of Computer Programming, vol- umee 3, chapter 6.4, pages 513 558. Second edition.

[KS86]] H.-R Krigel and B. Seeger. Multidimensional Order Preserv- ingg Linear Hashing with Partial Expansions. In International ConferenceConference on Database Theory, pages 203 220, Rome, 1986.

[KS88]] H.-P. Krigel and B. Seeger. PLOP-Hashing: A Grid File withoutt Directory. In ICDE: Fourth International Conference onon Data Engineering, pages 369 376, Los Angeles, California, 1988. .

[KTM084]] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka. Architec- turee and performance of relational algebra machine GRACE. Inn Proceedings of the Intl. Conference on Parallel Processing, Chicago,, 1984.

[KW94]] Birgitte Kröll and Peter Widmayer. Distributing a Search Treee Among a Growing Number of Processors. In ACM SIG- MODMOD Conference on the Management of Data, Mineapolis, 1994. .

[KW95]] Birgitte Kröll and Peter Widmayer. Balanced Distributed Searchh Trees Do Not Exists. In WADS Conference, Mineapo- lis,, 1995.

[Lar78]] P.A. Larson. Dynamic hashing. BIT, 18(2):184 201, 1978.

[Lar88]] P.A. Larson. Dynamic hash tables. In Communications of the ACM,ACM, volume 31(4), pages 446 57. April 1988. BIBLIOGRAPHY BIBLIOGRAPHY 147 7

[LER92]] Ted G. Lewis and Hesham El-Rewini. Introduction to Parallel Computing.Computing. Number ISBN 0-13-498916-3. Prentice Hall, 1992.

[Lit80]] W. Litwin. Linear Hashing: A new tool for file and table addressing.. In Procedings of VLDB, Montreal, Canada, 1980.

[Lit94]] W. Litwin. Linear Hashing: A new tool for file and ta- blee addressing. In Michael Stonebraker, editor, Readings in DATABASEDATABASE SYSTEMS, 2nd edition, pages 96 107. 1994.

[LN96a]] W. Litwin and M-A. Neimat. High-availability lh* schemes withh mirroring. In First IFCIS International Conference on CooperativeCooperative Information Systems (CoopIS'96), pages 196 205, Brussels,, Belgium, June 1996.

[LN96b]] W. Litwin and M-A Neimat. k-RP*: A Family of High Perfor- mancee Multi-attribute Scalable Distributed Data Structure. Inn IEEE International Conference on Parallel and Distributed Systems,Systems, PDIS-96, December 1996.

[LN97]] W. Litwin and M-A. Neimat. LH*s: A High-Availability andd High-Security Scalable Distributed Data Structure. In RIDE97:RIDE97: Seventh International Workshop on Research Issues InIn Data Engineering, Birmingham, England, 1997.

[LNS93]] W. Litwin, M-A Neimat, and D. Schneider. LH*: Linear hash- ingg for distributed files. In ACM-SIGMOD International Con- ferenceference On Management of Data, May 1993.

[LNS94]] W. Litwin, M-A Neimat, and D. Schneider. RP*: A Family off Order Preserving Scalable Distributed Data Structures. In ProcedingsProcedings of VLDB, 1994.

[LNS96]] W. Litwin, M-A. Neimat, and D. Schneider. LH*: A Scal- ablee Distributed Data Structure. ACM-TODS Transactions onon Database Systems, December 1996.

[LR85]] M. D. P. Leland and W. D. Roome. The silicon database ma- chine.. In Procedings 4th International Workshop on Database Machines,Machines, pages 169 189, Grand Bahama Island, March 1985.

[LS89]] David B. Lomet and Betty Salzberg. hB-tree: A Robust Multi- Attributee Search Structure. In Fifth International Conference onon Data Engineering, Los Angeles, California, February 1989.

[MSP93]] A. Matrone, P. Schiano, and V. Puotti. LINDA and PVM: A comparsionn between two environments for parallel program- ming.. Parallel Computing, 19:949 957, 1993. 1488 BIBLIOGRAPHY

[Mun99]] Rudolf Munz. Usage Scenarios of DBMS. URL, Septem- berr 1999. http://www.dcs.napier.ac.uk/~vldb99/ Industrial- SpeakerSlides/SAPVLDB.pdf. .

[NHS84]] Jörg Nievergelt, Hans Hinterberger, and Kenneth C. Sevcik. Thee grid file: An adaptable, symmetric multikey file structure. AA CM Transactions on Database Systems (TODS), 9(1):38 71, Marchh 1984.

[Ore82]] Jack A. Orenstein. Multidimensional tries used for associa- tivee searching. Information Processing Letters, 14(4):150 157, Junee 1982.

[Ors96]] Kjell Orsborn. On Extensible And Object-Relational Database TechnologyTechnology for Finite Element Analysis Applications. Disser- tationn No. 452, Department of Computer Science and Infor- mationn Science, Linköping University, 1996.

[OS83]] Yutaka Ohsawa and Masao Sakauchi. The BD-tree a new- dimensionall data structure with highly efficient dynamic char- acteristics.. Information Processing 83, 1983. North-Holland, Amsterdam,, 539-544.

[Oto84]] Ekow J. Otoo. A Mapping Function for the Directory of a Multidimensionall Extendible Hashing. In Tenth International ConferenceConference on Very Large Data Bases, pages 493 506, Singa- pore,, 1984.

[Oto88]] Ekow J. Otoo. Linearizing the Directory Growth in Order Preservingg Extendible Hashing. In ICDE: Fourth Interna- tionaltional Conference on Data Engineering, Los Angeles, Califor- nia,, 1988.

[OV91]] M. Tamer Ozsu and Patrick Valduriez. Principles of Dis- tributedtributed Database Systems. Number ISBN 0-13-715681-2. Prenticee Hall, 1991.

[Par94]] Parsytec Computer GmbH. Programmers Guide, Parix 1.2- PowerPC,PowerPC, 1994.

[Pet93]] M. Pettersson. Main-Memory Linear Hashing - Some En- hancementss of Larson's Algorithm. Technical Report LiTH- IDA-R-93-04,, ISSN-0281-4250, Department of Computer Sci- encee and Information Science, Linköping University, 1993.

[PGK88]] David A. Patterson, Garth A. Gibson, and Randy H. Katz. AA Case for Redundant Arrays of Inexpensive Disks (RAID). BIBLIOGRAPHY BIBLIOGRAPHY 149 9

Inn ACM SIGMOD International Conference on Management ofof Data, pages 109 116, Chicago, Illinois, USA, June 1988. SIGMOD. .

[Riv74]] Ronald Linn Rivest. Analysis of Associative Retrieval Algo- rithms.rithms. PhD-thesis STAN-CS-74-415, Computer Science De- partment,, Standford University, May 1974.

[Ron98]] Mikael Ronström. Design and Modelling of a Parallel Data ServerServer for Telecom Applications. PhD-thesis 1998:520, De- partmentt of Computer Science and Information Science, Linköpingg University, 1998.

[Sam89]] Hanan Samet. The Design and Analysis of Spatial Data Struc- tures.tures. January 1994 edition, 1989.

[SAP+96]] M. Stonebraker, P. M. Aoki, A. Pfeffer, A. Sah, J. Sidell, C.. Staelin, and A. Yu. MARIPOSA: A Wide-Area Distributed Databasee System. VLDB Journal, 5(1):48 63, January 1996. http://epoch.CS.Berkeley.EDU:8000/mariposa/papers/s2k-- 95-63.ps. .

[SAS95]] Vineet Singh, Minesh Amin, and Donovan Schneider. An Adaptive,, Load Balancing Parallel Join Algorithm. Techni- call Report HPL-95-46, Hewlett-Packard Labs, 1995.

[SFGM93]] M. Stonebraker, J. Frew, K. Gardels, and J. Meredith. The Se- quoiaa 2000 Storage Benchmark. In 19th ACM SIGMOD Con- ferenceference on the Management of Data, Washington DC, USA, Mayy 1993.

[SKPO88]] M. Stonebraker, R. Katz, D. Patterson, and J. Ousterhout. Thee Design of XPRS. In VLDB Conference, volume 14, pages 3188 330, Los Angeles, California, 1988.

[SM96]] Michael Stonebraker and Dorothy Moore. Object-Relational DBMSs:DBMSs: The Next Great Wave. Number ISBN 1-55860-397-2. Morgann Kaufmann Publishers, INC., San Francisco, Califor- nia,, 1996.

[SPW90]] C. Severance, S. Pramanik, and P. Wolberg. Distributed linear hashingg and parallel projection in main memory databases. In ProceedingsProceedings of the 16th International Conference on VLDB, Brisbane,, Australia, 1990.

[Ste94]] W. Richard Stevens. TCP/IP Illustrated Volume 1. Addison- Wesley,, 1994. 150 0 BIBLIOGRAPHY BIBLIOGRAPHY

[Tam81]] Markku Tamminen. Order Preserving Extendible Hashing and Buckett Tries. BIT, 21(4):419 435, 1981.

[Tan87]] Tandem. Nonstop sql - a distributed high-performance, high- availabilityy implementation of sql. In Procedings International WorkshopWorkshop on High Performance Transaction Systems, pages 3377 341, Asilomar, Calif., September 1987.

[Tan95]] Andrew S. Tanenbaum. Distributed Operating Systems. 1995.

[Tim]] TimesTen. TimesTen Performance Software. http://www.timesten.com/. .

[Tor95]] 0ystein Torbj0rnsen. Multi-Site Declustering Strategies for VeryVery High Database Service Availability. PhD-thesis 1995:16, Departmentt of Computer Systems and Telematics, Faculty of Electricall Engineering and Computer Science, Norwegian In- stitutee of Technology, University of Trondheim, Norway, 1995.

[WBW94]] R. Wingralek, Y. Breitbart, and G. Weikum. Distributed filee organisation with scalable cost/performance. In ACM- SIGMODSIGMOD International Conference On Management of Data, Mayy 1994.

[WSB98]] Roger Weber, Hans-J. Schek, and Stephen Blott. A quan- titativee analysis and performance study for similarity-search methodss in high-dimensional spaces. In Proceedings of the 24th VLDBVLDB Conference, pages 194 205, New York, USA, 1998.