Ubiquitous B-Tree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Ubiquitous B-Tree

Full text

Pdf (1.37 MB)

Source

ACM Computing Surveys (CSUR) archive
Volume 11 , Issue 2 (June 1979) table of contents

Pages: 121 - 137

Year of Publication: 1979

ISSN:0360-0300

Author

Douglas Comer

Computer Science Department, Purdue University, West Lafayette, Indiana

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 78, Downloads (12 Months): 694, Citation Count: 321

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/356770.356776 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AHO74	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	AUER76	AuER, R. Schlusselkompress~onen ~n B*-baumen, Diplomarbeit, Tech. Umversitat, Munich, 1976.
	BAYE72	BAYER, R, AND MCCREmHT, C "Organization and maintenance of large ordered indexes," Acta inf. 1, 3 (1972), 173- 189.
	BAYE72a	BAYER, R. "Binary B-trees for virtual memory," in Proc 1971 ACM SIGFIDET Workshop, ACM, New York, 219-235.
	BAYE73	BAYER, R. "Symmetric binary B-trees. data structure and maintenance algorithms," Acta Inf. 1, 4 (1972), 290-306
	BAYE76	R. Bayer , J. K. Metzger, On the encipherment of search trees and random access files, ACM Transactions on Database Systems (TODS), v.1 n.1, p.37-52, March 1976 [doi>10.1145/320434.320445]
	BAYE77	Rudolf Bayer , Karl Unterauer, Prefix B-trees, ACM Transactions on Database Systems (TODS), v.2 n.1, p.11-26, March 1977 [doi>10.1145/320521.320530]
	BAYE77a	BAYER, R., AND SCHKOLNICK, M. "Concurrency of operations on B-trees," Acta Inf. 9, 1 (1977), 1-21.
	BERL78	BERLINER, H. The B*-tree search algorithm: a best-fwst proof procedure, Tech. Rep. CMU-CA-78-112, Computer Scmnce Dept, Carnegie-Mellon Univ., Pittsburgh, 1978.
	BROW78	BROWN, M "A storage scheme for height-balanced trees," Inf. Process. Lett. 7, 5 (Aug. 1978), 231-232.
	BROW78a	BROWN, M. "A partial analysis of height-balanced trees," SIAM J. Comput., to appear.
	CLAM64	Harry A. Clampett, Jr., Randomized binary searching with tree structures, Communications of the ACM, v.7 n.3, p.163-165, March 1964 [doi>10.1145/363958.363987]
	FOST65	C. C. Foster, Information retrieval: information storage and retrieval using AVL trees, Proceedings of the 1965 20th national conference, p.192-205, August 24-26, 1965, Cleveland, Ohio, United States [doi>10.1145/800197.806043]
	GHOS69	S. P. Ghosh , M. E. Senko, File Organization: On the Selection of Random Access Index Points for Sequential Files, Journal of the ACM (JACM), v.16 n.4, p.569-579, Oct. 1969 [doi>10.1145/321541.321546]
	GUIB77	Leo J. Guibas , Edward M. McCreight , Michael F. Plass , Janet R. Roberts, A new representation for linear lists, Proceedings of the ninth annual ACM symposium on Theory of computing, p.49-60, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803395]
	GUIB78	GUIBAS, L., AND SEDGEWICK, R. "A dichromatic framework for balanced trees," m Proc 19th Syrup. Foundatmns of Computer Science, 1978, 8-21.
	HELD78	Gerald Held , Michael Stonebraker, B-trees re-examined, Communications of the ACM, v.21 n.2, p.139-143, Feb. 1978 [doi>10.1145/359340.359348]
	HORO76	HOROWITZ, E., AND SAHNI, S. Fundamentals of data structures, Computer Science Press, Inc., Woodland Hills, Calif., 1976.
	IBM1	OS/VS Virtual Storage Access Method (VSAM) planning gutde, Order No. GC26-3799, IBM, Armonk, N.Y.
	IBM2	OS/VS Vwtual Storage Access Method (VSAM) logw, Order No. SY26-3841, IBM, Armonk, N.Y.
	KARL76	P. L. Karlton , S. H. Fuller , R. E. Scroggs , E. B. Kaehler, Performance of height-balanced trees, Communications of the ACM, v.19 n.1, p.23-28, Jan. 1976 [doi>10.1145/359970.359989]
	KEEH74	KEEHN, D., AND LACY, J. "VSAM data set design parameters," IBM Syst. J. 3, (1974), 186-212.
	KNUT68	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	KNUT73	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	MARU77	K. Maruyama , S. E. Smith, Analysis of design alternatives for virtual memory indexes, Communications of the ACM, v.20 n.4, p.245-254, April 1977 [doi>10.1145/359461.359471]
	MAUE75	W. D. Maurer , T. G. Lewis, Hash Table Methods, ACM Computing Surveys (CSUR), v.7 n.1, p.5-19, March 1975 [doi>10.1145/356643.356645]
	MCCR77	Edward M. McCreight, Pagination of B*-trees with variable-length records, Communications of the ACM, v.20 n.9, p.670-674, Sept. 1977 [doi>10.1145/359810.359839]
	MILL77	MILLER, R., PIPPENGER, N., ROSENBERG, A., AND SNYDER, L. Optimal 2-3 trees, IBM Research Rep. RC 6505, IBM Research Lab, Yorktown Heights, N.Y., 1977.
	NIEV74	J. Nievergelt, Binary Search Trees and File Organization, ACM Computing Surveys (CSUR), v.6 n.3, p.195-207, Sept. 1974 [doi>10.1145/356631.356634]
	ORGA72	Elliott I. Organick, The Multics System: An Examination of Its Structure, The MIT Press, 1972
	ROSE78	ROSENBERG, A, AND SNYDER, L. "Minimal comparison 2-3 trees," SIAM J. Comput 7, 4 (Nov. 1978), 465-480.
	RUBI76	Frank Rubin, Experiments in text file compression, Communications of the ACM, v.19 n.11, p.617-623, Nov. 1976 [doi>10.1145/360363.360368]
	SAMA76	SAMADI, B. "B-trees m a system w~th multiple vmws," Inf. Process. Lett. 5, 4 (Oct. 1976), 107-112
	SEVE74	Dennis G. Severance, Identifier Search Mechanisms: A Survey and Generalized Model, ACM Computing Surveys (CSUR), v.6 n.3, p.175-194, Sept. 1974 [doi>10.1145/356631.356633]
	WAGN73	WAGNER, R. "Indexing demgn considerations," IBM Syst. J. 4, (1973), 351-367.
	WEDE74	WEDEKIND, H. "On the selection of access paths in a database system," in Data base management (Proc. IFIP Working Conf. Data Base Management) J Klimbie and K. Koffeman (Eds.), Elsevier/ North-Holland Pubhshmg Co., New York, 1974, 385-397.
	WIRT76	Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice Hall PTR, Upper Saddle River, NJ, 1978
	YAO78	YAO, A. "On random 2-3 trees," Acta Inf. 9, 2 (1978), 159-170.

CITED BY 321

	Kihong Kim , Sang K. Cha, Sibling clustering of tree-based spatial indexes for efficient spatial query processing, Proceedings of the seventh international conference on Information and knowledge management, p.398-405, November 02-07, 1998, Bethesda, Maryland, United States
	Lars Arge , Jan Vahrenhold, I/O-efficient dynamic planar point location (extended abstract), Proceedings of the sixteenth annual symposium on Computational geometry, p.191-200, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
	Ling Lin , Tore Risch , Martin Sköld , Dushan Badal, Indexing values of time sequences, Proceedings of the fifth international conference on Information and knowledge management, p.223-232, November 12-16, 1996, Rockville, Maryland, United States
	Alan L. Tharp , John L. Furlani, The CD-ROM foster a new data structure: the B3-tree, Proceedings of the 1993 ACM conference on Computer science, p.466-471, February 16-18, 1993, Indianapolis, Indiana, United States
	Pankaj K. Agarwal , Lars Arge , Jeff Erickson , Paolo G. Franciosa , Jeffry Scott Vitter, Efficient searching with linear constraints, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.169-178, June 01-04, 1998, Seattle, Washington, United States
	Bernhard Seeger , Per-Åke Larson, Multi-disk B-trees, ACM SIGMOD Record, v.20 n.2, p.436-445, June 1991
	W. Kim , J. F. Garza , N. Ballou , D. Woelk, Architecture of the ORION Next-Generation Database System, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.109-124, March 1990
	Wilfred J. Hansen, A Cost Model for the Internal Organization of B+-Tree Nodes, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.4, p.508-532, Oct. 1981
	Paris Kanellakis, Constraint programming and database languages: a tutorial, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.46-53, May 22-25, 1995, San Jose, California, United States
	Xiaoming Cheng , Huizhu Lu , G. E. Hedrick, Searching spatial objects with index by dimensional projections, Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, p.217-223, April 1992, Kansas City, Missouri, United States
	Paris C. Kanellakis , Sridhar Ramaswamy , Darren E. Vengroff , Jeffrey S. Vitter, Indexing for data models with constraints and classes (extended abstract), Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.233-243, May 25-28, 1993, Washington, D.C., United States
	Porter Eugene Smith , James H. Graham, A simple balanced search tree, Proceedings of the 1993 ACM conference on Computer science, p.461-465, February 16-18, 1993, Indianapolis, Indiana, United States
	Benjamin W. Wah , Guo-Jie Li , Chee-Fen Yu, The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems, ACM SIGARCH Computer Architecture News, v.12 n.3, p.56-63, June 1984
	S. Finkelstein , M. Schkolnick , P. Tiberio, Physical database design for relational databases, ACM Transactions on Database Systems (TODS), v.13 n.1, p.91-128, March 1988
	Sridhar Ramaswamy , Paris C. Kanellakis, OODB indexing by class-division, ACM SIGMOD Record, v.24 n.2, p.139-150, May 1995
	Giovanni Maria Sacco , Mario Schkolnick, Buffer management in relational database systems, ACM Transactions on Database Systems (TODS), v.11 n.4, p.473-498, Dec. 1986
	Lars Arge , Vasilis Samoladas , Jeffrey Scott Vitter, On two-dimensional indexability and optimal range search indexing, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.346-357, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	Brian F. Cooper , Neal Sample , Moshe Shadmon, A parallel index for semistructured data, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
	Wilson C. Hsieh , Paul Wang , William E. Weihl, Computation migration: enhancing locality for distributed-memory parallel systems, ACM SIGPLAN Notices, v.28 n.7, p.239-248, July 1993
	D. Motzkin, An efficient directory system for document retrieval, Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval, p.291-303, October 13-16, 1991, Chicago, Illinois, United States
	Lars Arge , Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter, On sorting strings in external memory (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.540-548, May 04-06, 1997, El Paso, Texas, United States
	Ming-Chuan Wu, Query optimization for selections using bitmaps, ACM SIGMOD Record, v.28 n.2, p.227-238, June 1999
	Anil K. Garg , C. C. Gotlieb, Order-preserving key transformations, ACM Transactions on Database Systems (TODS), v.11 n.2, p.213-234, June 1986
	Nagavamsi Ponnekanti , Hanuma Kodavalla, Online index rebuild, ACM SIGMOD Record, v.29 n.2, p.529-538, June 2000
	George Kollios , Dimitrios Gunopulos , Vassilis J. Tsotras, On indexing mobile objects, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.261-272, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	Patrick O'Neil , Dallan Quass, Improved query performance with variant indexes, ACM SIGMOD Record, v.26 n.2, p.38-49, June 1997
	Peter Bumbulis , Ivan T. Bowman, A compact B-tree, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	B. C. Desai , P. Goyal , F. Sadri, Use of composite index in DDBMS, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.251-260, February 1986, Cincinnati, Ohio, United States
	Andreas Henrich, The update of index structures in object-oriented DBMS, Proceedings of the sixth international conference on Information and knowledge management, p.136-143, November 10-14, 1997, Las Vegas, Nevada, United States
	Elisa Bertino, Method precomputation in object-oriented databases, ACM SIGOIS Bulletin, v.12 n.2-3, p.199-212, Nov. 1991
	Tetsuro Ito , Makoto Kizawa, Hierarchical file organization and its application to similar-string matching, ACM Transactions on Database Systems (TODS), v.8 n.3, p.410-433, Sept. 1983
	Hanan Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys (CSUR), v.16 n.2, p.187-260, June 1984
	Christer Hultén, An index organization for applications with highly skewed access patterns, Proceedings of the 5th international conference on Software engineering, p.71-78, March 09-12, 1981, San Diego, California, United States
	Vladimir Lanin , Dennis Shasha, A symmetric concurrent B-tree algorithm, Proceedings of 1986 ACM Fall joint computer conference, p.380-389, November 1986, Dallas, Texas, United States
	Lothar F. Mackert , Guy M. Lohman, Index scans using a finite LRU buffer: a validated I/O model, ACM Transactions on Database Systems (TODS), v.14 n.3, p.401-424, Sept. 1989
	Vijay Kumar, Concurrent operations on extendible hashing and its performance, Communications of the ACM, v.33 n.6, p.681-694, June 1990
	Donald D. Chamberlin , Morton M. Astrahan , Michael W. Blasgen , James N. Gray , W. Frank King , Bruce G. Lindsay , Raymond Lorie , James W. Mehl , Thomas G. Price , Franco Putzolu , Patricia Griffiths Selinger , Mario Schkolnick , Donald R. Slutz , Irving L. Traiger , Bradford W. Wade , Robert A. Yost, A history and evaluation of System R, Communications of the ACM, v.24 n.10, p.632-646, Oct. 1981
	Robert W.P. Luk , H. V. Leong , Tharam S. Dillon , Alvin T.S. Chan , W. Bruce Croft , James Allan, A survey in indexing and searching XML documents, Journal of the American Society for Information Science and Technology, v.53 n.6, p.415-437, May, 2002
	Gabriel Matsliach, Performance analysis of file organizations that use multi-bucket data leaves with partial expansions (extended abstract), Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.164-180, May 29-31, 1991, Denver, Colorado, United States
	Joseph M. Hellerstein , Elias Koutsoupias , Christos H. Papadimitriou, On the analysis of indexing schemes, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.249-256, May 11-15, 1997, Tucson, Arizona, United States
	Michael Stonebraker , Heidi Stettner , Nadene Lynn , Joseph Kalash , Antonin Guttman, Document processing in a relational database system, ACM Transactions on Information Systems (TOIS), v.1 n.2, p.143-158, April 1983
	Lawrence W. West, Postorder B-tree construction, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
	Hanan Samet , Robert E. Webber, Storing a collection of polygons using quadtrees, ACM Transactions on Graphics (TOG), v.4 n.3, p.182-222, July 1985
	Michael Freeston, A general solution of the n-dimensional B-tree problem, ACM SIGMOD Record, v.24 n.2, p.80-91, May 1995
	Yannis Theodoridis , Emmanuel Stefanakis , Timos Sellis, Efficient Cost Models for Spatial Queries Using R-Trees, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.19-32, January 2000
	M. Schkolnick , P. Tiberio, Estimating the cost of updates in a relational database, ACM Transactions on Database Systems (TODS), v.10 n.2, p.163-179, June 1985
	Hanan Samet, Hierarchical representations of collections of small rectangles, ACM Computing Surveys (CSUR), v.20 n.4, p.271-309, Dec. 1988
	S. Christodoulakis , D. A. Ford, File organizations and access methods for CLV disks, ACM SIGIR Forum, v.23 n.SI, p.152-159, June 1989
	Jingren Zhou , Kenneth A. Ross, Implementing database operations using SIMD instructions, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
	Pankaj K. Agarwal , Lars Arge , T. M. Murali , Kasturi R. Varadarajan , Jeffrey Scott Vitter, I/O-efficient algorithms for contour-line extraction and planar graph blocking, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.117-126, January 25-27, 1998, San Francisco, California, United States
	Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998
	David B. Lomet , Betty Salzberg, The hB-tree: a multiattribute indexing method with good guaranteed performance, ACM Transactions on Database Systems (TODS), v.15 n.4, p.625-658, Dec. 1990
	Gísli R. Hjaltason , Hanan Samet, Distance browsing in spatial databases, ACM Transactions on Database Systems (TODS), v.24 n.2, p.265-318, June 1999
	Pankaj K. Agarwal , Lars Arge , Gerth Stølting Brodal , Jeffrey S. Vitter, I/O-efficient dynamic point location in monotone planar subdivisions, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.11-20, January 17-19, 1999, Baltimore, Maryland, United States
	Malcolm Wallace , Colin Runciman, The bits between the lambdas: binary data in a lazy functional language, ACM SIGPLAN Notices, v.34 n.3, p.107-117, March 1999
	D. S. Batory, Modeling the storage architectures of commercial database systems, ACM Transactions on Database Systems (TODS), v.10 n.4, p.463-528, Dec. 1985
	Lixin Fu , Joachim Hammer, CubiST: a new algorithm for improving the performance of ad-hoc OLAP queries, Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP, p.72-79, November 06-11, 2000, McLean, Virginia, United States
	E. Bertino , W. Kim, Indexing Techniques for Queries on Nested Objects, IEEE Transactions on Knowledge and Data Engineering, v.1 n.2, p.196-214, June 1989
	Patrick A. V. Hall , Geoff R. Dowling, Approximate String Matching, ACM Computing Surveys (CSUR), v.12 n.4, p.381-402, Dec. 1980
	Mohamed F. Mokbel , Walid G. Aref, Irregularity in multi-dimensional space-filling curves with applications in multimedia databases, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
	Gopal K. Gupta, Self-assessment procedure XIII: a self-assessment procedure dealing with binary search trees and B-trees, Communications of the ACM, v.27 n.5, p.435-443, May 1984
	Patrick Valduriez, Join indices, ACM Transactions on Database Systems (TODS), v.12 n.2, p.218-246, June 1987
	Paolo Ferragina , Roberto Grossi, The string B-tree: a new data structure for string search in external memory and its applications, Journal of the ACM (JACM), v.46 n.2, p.236-280, March 1999
	A. Kumar, G-Tree: A New Data Structure for Organizing Multidimensional Data, IEEE Transactions on Knowledge and Data Engineering, v.6 n.2, p.341-347, April 1994
	Christian Böhm , Stefan Berchtold , Daniel A. Keim, Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases, ACM Computing Surveys (CSUR), v.33 n.3, p.322-373, September 2001
	Dennis Shasha, Tuning databases for high performance, ACM Computing Surveys (CSUR), v.28 n.1, p.113-115, March 1996
	Yannis Theodoridis , Timos Sellis, A model for the prediction of R-tree performance, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.161-171, June 04-06, 1996, Montreal, Quebec, Canada
	Sairam Subramanian , Sridhar Ramaswamy, The P-range tree: a new data structure for range searching in secondary memory, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.378-387, January 22-24, 1995, San Francisco, California, United States
	Jeffrey Scott Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys (CSUR), v.33 n.2, p.209-271, June 2001
	Chee Chin Low , Beng Chin Ooi , Hongjun Lu, H-trees: a dynamic associative search index for OODB, ACM SIGMOD Record, v.21 n.2, p.134-143, June 1, 1992
	Beng Chin Ooi , Kian-Lee Tan , Cui Yu , Stephane Bressan, Indexing the edges—a simple and yet efficient approach to high-dimensional indexing, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.166-174, May 15-18, 2000, Dallas, Texas, United States
	David E. Ferguson, Bit-Tree: a data structure for fast file processing, Communications of the ACM, v.35 n.6, p.114-120, June 1992
	Liba Svobodova, File servers for network-based distributed systems, ACM Computing Surveys (CSUR), v.16 n.4, p.353-398, Dec. 1984
	Chris Faloutsos, Access methods for text, ACM Computing Surveys (CSUR), v.17 n.1, p.49-74, March 1985
	Trishul M. Chilimbi , Mark D. Hill , James R. Larus, Cache-conscious structure layout, ACM SIGPLAN Notices, v.34 n.5, p.1-12, May 1999
	Paolo Ferragina , Roberto Grossi, A fully-dynamic data structure for external substring search, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.693-702, May 29-June 01, 1995, Las Vegas, Nevada, United States
	Jun Rao , Kenneth A. Ross, Making B+- trees cache conscious in main memory, ACM SIGMOD Record, v.29 n.2, p.475-486, June 2000
	Tobin J. Lehman , Michael J. Carey, Query processing in main memory database management systems, ACM SIGMOD Record, v.15 n.2, p.239-250, June 1986
	Michael Lee , Hanan Samet, Navigating through triangle meshes implemented as linear quadtrees, ACM Transactions on Graphics (TOG), v.19 n.2, p.79-121, April 2000
	Ching-Tien Ho , Rakesh Agrawal , Nimrod Megiddo , Ramakrishnan Srikant, Range queries in OLAP data cubes, ACM SIGMOD Record, v.26 n.2, p.73-88, June 1997
	Sitaram Lanka , Eric Mays, Fully persistent B+-trees, ACM SIGMOD Record, v.20 n.2, p.426-435, June 1991
	Jignesh M. Patel , Michael J. Carey , Mary K. Vernon, Accurate modeling of the hybrid hash join algorithm, ACM SIGMETRICS Performance Evaluation Review, v.22 n.1, p.56-66, May 1994
	Stefan Berchtold , Christian Böhm , Hans-Peter Kriegal, The pyramid-technique: towards breaking the curse of dimensionality, ACM SIGMOD Record, v.27 n.2, p.142-153, June 1998
	Yin-he Jiang , Xiangning Liu , Bharat Bhargava, Re-evaluating indexing schemes for nested objects, Proceedings of the third international conference on Information and knowledge management, p.439-446, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	John T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan
	Witold Litwin, Trie hashing, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan
	Bingsheng He , Qiong Luo, Cache-oblivious nested-loop joins, Proceedings of the 15th ACM international conference on Information and knowledge management, November 06-11, 2006, Arlington, Virginia, USA
	Antonin Guttman, R-trees: a dynamic index structure for spatial searching, ACM SIGMOD Record, v.14 n.2, June 1984
	Mario A. Nascimento , Eleni Tousidou , Vishal Chitkara , Yannis Manolopoulos, Image indexing and retrieval using signature trees, Data & Knowledge Engineering, v.43 n.1, p.57-77, October 2002
	Elisa Bertino, Index configuration in object-oriented databases, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.3, p.355-399, July 1994
	A. Biliris, Operation specific locking in B-trees, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.159-169, March 23-25, 1987, San Diego, California, United States
	Joshua J. Bloch , Dean S. Daniels , Alfred Z. Spector, A weighted voting algorithm for replicated directories, Journal of the ACM (JACM), v.34 n.4, p.859-909, Oct. 1987
	Sang-Wook Kim , Hee-Sun Won, Batch-construction of B+-trees, Proceedings of the 2001 ACM symposium on Applied computing, p.231-235, March 2001, Las Vegas, Nevada, United States
	Dennis Shasha , Nathan Goodman, Concurrent search structure algorithms, ACM Transactions on Database Systems (TODS), v.13 n.1, p.53-90, March 1988
	Mark N. Haynie, Tutorial: The relational data model for Design Automation, Proceedings of the 20th conference on Design automation, p.599-607, June 27-29, 1983, Miami Beach, Florida, United States
	Doug Dyment, FINNET—a homogeneous multiprocessor network, Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems, p.60-66, September 18-19, 1980, Palo Alto, California, United States
	V. Srinivasan , Michael J. Carey, Performance of B-tree concurrency control algorithms, ACM SIGMOD Record, v.20 n.2, p.416-425, June 1991
	D. A. Beckley , M. W. Evens , V. K. Raman, Multikey retrieval from K-d trees and QUAD-trees, ACM SIGMOD Record, v.14 n.4, p.291-301, May 1985
	Sridhar Ramaswamy , Sairam Subramanian, Path caching (extended abstract): a technique for optimal external searching, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.25-35, May 24-27, 1994, Minneapolis, Minnesota, United States
	Shou-Hsuan S. Huang, Height-balanced trees of order (β, γ, δ), ACM Transactions on Database Systems (TODS), v.10 n.2, p.261-284, June 1985
	Paolo Ferragina , Roberto Grossi, Fast string searching in secondary storage: theoretical developments and experimental results, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.373-382, January 28-30, 1996, Atlanta, Georgia, United States
	Trishul M. Chilimbi , Mark D. Hill , James R. Larus, Making Pointer-Based Data Structures Cache Conscious, Computer, v.33 n.12, p.67-74, December 2000
	Randal C. Nelson , Hanan Samet, A consistent hierarchical representation for vector data, ACM SIGGRAPH Computer Graphics, v.20 n.4, p.197-206, Aug. 1986
	Jorge F. Garza , Won Kim, Transaction management in an object-oriented database system, ACM SIGMOD Record, v.17 n.3, p.37-45, June 1988
	Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter, Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.685-694, January 25-27, 1998, San Francisco, California, United States
	Dean Daniels , Alfred Z. Spector, An algorithm, for replicated directories, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.104-113, August 17-19, 1983, Montreal, Quebec, Canada
	James E. Allchin , Arthur M. Keller , Gio Wiederhold, FLASH: a language-independent, portable file access system, Proceedings of the 1980 ACM SIGMOD international conference on Management of data, May 14-16, 1980, Santa Monica, California
	Kurt Stockinger , Kesheng Wu , Arie Shoshani, Strategies for processing ad hoc queries on large data warehouses, Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, p.72-79, November 08-08, 2002, McLean, Virginia, USA
	Eugene Inseok Chong , Jagannathan Srinivasan , Souripriya Das , Chuck Freiwald , Aravind Yalamanchi , Mahesh Jagannath , Anh-Tuan Tran , Ramkumar Krishnan , Richard Jiang, A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B⁺-trees, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
	Robert C. Goldstein , Christian Wagner, Database Management with Sequence Trees and Tokens, IEEE Transactions on Knowledge and Data Engineering, v.9 n.1, p.186-192, January 1997
	Rudolf Bayer, B-trees and databases, past and future, Software pioneers: contributions to software engineering, Springer-Verlag New York, Inc., New York, NY, 2002
	David Taniar , J. Wenny Rahayu, A Taxonomy of Indexing Schemes for Parallel Database Systems, Distributed and Parallel Databases, v.12 n.1, p.73-106, July 2002
	L. M. Haas , W. Chang , G. M. Lohman , J. McPherson , P. F. Wilms , G. Lapis , B. Lindsay , H. Pirahesh , M. J. Carey , E. Shekita, Starburst Mid-Flight: As the Dust Clears, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.143-160, March 1990
	Ratko Orlandic , Jack Lukaszuk , Craig Swietlik, The design of a retrieval technique for high-dimensional data on tertiary storage, ACM SIGMOD Record, v.31 n.2, June 2002
	D. S. Batory, B+ trees and indexed sequential files: a performance comparison, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan
	Ratko Orlandic , Byunggu Yu, A retrieval technique for high-dimensional data and partially specified queries, Data & Knowledge Engineering, v.42 n.1, p.1-21, July 2002
	J. Srivastava , J. S. E. Tan , V. Y. Lum, TBSAM: An Access Method for Efficient Processing of Statistical Queries, IEEE Transactions on Knowledge and Data Engineering, v.1 n.4, p.414-423, December 1989
	Chi-wai Fung , Kamalakar Karlapalem , Qing Li, An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases, IEEE Transactions on Knowledge and Data Engineering, v.14 n.5, p.1095-1118, September 2002
	Mohamed F. Mokbel , Walid G. Aref , Ibrahim Kamel, Analysis of Multi-Dimensional Space-Filling Curves, Geoinformatica, v.7 n.3, p.179-209, September 2003
	Lars Arge , Jan Vahrenhold, I/O-efficient dynamic planar point location, Computational Geometry: Theory and Applications, v.29 n.2, p.147-162, October 2004
	Eugene Inseok Chong , Jagannathan Srinivasan , Souripriya Das , Chuck Freiwald , Aravind Yalamanchi , Mahesh Jagannath , Anh-Tuan Tran , Ramkumar Krishnan , Richard Jiang, A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B⁺-trees, ACM SIGMOD Record, v.32 n.2, June 2003
	Lars Arge, External memory data structures, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
	Pankaj K. Agarwal , Lars Arge , Andrew Danner , Bryan Holland-Minkley, Cache-oblivious data structures for orthogonal range searching, Proceedings of the nineteenth annual symposium on Computational geometry, June 08-10, 2003, San Diego, California, USA
	Lauri Malmi, A new method for updating and rebalancing tree-type main memory dictionaries, Nordic Journal of Computing, v.3 n.2, p.111-130, Summer 1996
	Oliver Günther, Data management in environmental information systems, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
	C. Sartori , M. R. Scalas, Partial Indexing for Nonuniform Data Distributions in Relational DBMS's, IEEE Transactions on Knowledge and Data Engineering, v.6 n.3, p.420-429, June 1994
	Michael Stonebraker, Virtual memory transaction management, ACM SIGOPS Operating Systems Review, v.18 n.2, p.8-16, April 1984
	Leonardo Tininini, Querying multidimensional data, Multidimensional databases: problems and solutions, Idea Group Publishing, Hershey, PA, 2003
	Shu-Ching Chen , R. L. Kashyap, A Spatio-Temporal Semantic Model for Multimedia Database Systems and Multimedia Information Systems, IEEE Transactions on Knowledge and Data Engineering, v.13 n.4, p.607-622, July 2001
	Erik G. Hoel , Hanan Samet, Data-parallel polygonization, Parallel Computing, v.29 n.10, p.1381-1401, October 2003
	Xin Li , Young Jin Kim , Ramesh Govindan , Wei Hong, Multi-dimensional range queries in sensor networks, Proceedings of the 1st international conference on Embedded networked sensor systems, November 05-07, 2003, Los Angeles, California, USA
	David M. Arnow , Aaron M. Tenenbaum, An empirical comparison of B-trees, compact B-trees and multiway trees, ACM SIGMOD Record, v.14 n.2, June 1984
	Wanlin Cao , Y. Edmund Lien , Yuane Qiu , Li Shao, A distributed engineering database management system for IC design, Proceedings of the conference on European design automation, February 25-28, 1991, Amsterdam, The Netherlands
	Lars Arge , Andrew Danner , Sha-Mayn Teh, I/O-efficient point location using persistent B-trees, Journal of Experimental Algorithmics (JEA), 8, 2003
	Herman Lam , Stanley Y. W. Su , Nageshwar R. Koganti, A Physical Database Design Evaluation System for CODASYL Databases, IEEE Transactions on Software Engineering, v.14 n.7, p.1010-1022, July 1988
	S. Ayse Özel , I. Sengör Altingövde , Özgür Ulusoy , Gültekin Özsoyoǧlu , Z. Meral Özsoyoǧlu, Metadata-based modeling of information resources on the Web, Journal of the American Society for Information Science and Technology, v.55 n.2, p.97-110, January 15, 2004
	Kn. I. Kilov , I. A. Popova, Meta-database architecture for relational DBMS, ACM SIGMOD Record, v.12 n.1, p.18-25, October 1981
	K. Fujimura , P. Jalote, On Robustness of B-Trees, IEEE Transactions on Knowledge and Data Engineering, v.5 n.3, p.530-534, June 1993
	Goetz Graefe, Query evaluation techniques for large databases, ACM Computing Surveys (CSUR), v.25 n.2, p.73-169, June 1993
	Vram Kouramajian , Ibrahim Kamel , Ramez Elmasri , Syed Waheed, The time index+: an incremental access structure for temporal databases, Proceedings of the third international conference on Information and knowledge management, p.296-303, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	David M. Arnow , Aaron M. Tenenbaum , Connie Wu, P-trees: storage efficient multiway trees, Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, p.111-121, June 05-07, 1985, Montreal, Quebec, Canada
	Stavros Christodoulakis , Daniel Alexander Ford, Retrieval performance versus disc space utilization on WORM optical discs, ACM SIGMOD Record, v.18 n.2, p.306-314, June 1989
	George Diehr , Bruce Faaland, Optimal pagination of B-trees with variable-length items, Communications of the ACM, v.27 n.3, p.241-247, March 1984
	Gísli R. Hjaltason , Hanan Samet, Incremental distance join algorithms for spatial databases, ACM SIGMOD Record, v.27 n.2, p.237-248, June 1998
	Gabriel Matsliach, Performance analysis of file organizations that use multibucket data leaves with partial expansions, ACM Transactions on Database Systems (TODS), v.18 n.1, p.157-180, March 1993
	Y. Nakamura , S. Abe , Y. Ohsawa , M. Sakauchi, A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics, IEEE Transactions on Knowledge and Data Engineering, v.5 n.4, p.682-694, August 1993
	F. Grandi , M. R. Scalas, Block Access Estimation for Clustered Data Using a Finite LRU Buffer, IEEE Transactions on Software Engineering, v.19 n.7, p.641-660, July 1993
	George Kollios , Vassilis J. Tsotras, Hashing Methods for Temporal Data, IEEE Transactions on Knowledge and Data Engineering, v.14 n.4, p.902-919, July 2002
	Evans J. Adams, Workload models for DBMS performance evaluation, Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, p.185-195, March 1985, New Orleans, Louisiana, United States
	Ing-Ray Chen , Salah Hassan, Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems, Proceedings of the 1995 ACM symposium on Applied computing, p.40-45, February 26-28, 1995, Nashville, Tennessee, United States
	Claudio Esperança , Hanan Samet, Experience with SAND-Tcl: a scripting tool for spatial databases, Proceedings of the 2000 annual national conference on Digital government research, p.1-24, May 15-17, 2000
	Randy H. Katz, A database approach for managing VLSI design data, Proceedings of the 19th conference on Design automation, p.274-282, January 1982
	R. A. Baeza-Yates , P. -A. Larson, Performance of B±Trees with Partial Expansions, IEEE Transactions on Knowledge and Data Engineering, v.1 n.2, p.248-257, June 1989
	Theodore Johnson , Padmashree Krishna, Lazy updates for distributed search structure, ACM SIGMOD Record, v.22 n.2, p.337-346, June 1, 1993
	Rakesh Agrawal , Ramakrishnan Srikant, Searching with numbers, Proceedings of the 11th international conference on World Wide Web, May 07-11, 2002, Honolulu, Hawaii, USA
	J. Banerjee , W. Kim , S.-J. Kim , J. F. Garza, Clustering a DAG for CAD Databases, IEEE Transactions on Software Engineering, v.14 n.11, p.1684-1699, November 1988
	S. D. Lang , Yannis Manolopoulos, Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files, IEEE Transactions on Software Engineering, v.16 n.12, p.1433-1435, December 1990
	Witold A. Litwin , Nick Roussopoulos , Gerald Levy , Wang Hong, Trie Hashing with Controlled Load, IEEE Transactions on Software Engineering, v.17 n.7, p.678-691, July 1991
	David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker , David Wood, Implementation techniques for main memory database systems, ACM SIGMOD Record, v.14 n.2, June 1984
	O. Günther , J. Bilmes, Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, v.3 n.3, p.342-356, September 1991
	Jack Lukaszuk , Ratko Orlandic, On accessing data in high-dimensional spaces: a comparative study of three space partitioning strategies, Journal of Systems and Software, v.73 n.1, p.147-157, September 2004
	Joachim Hammer , Lixin Fu, CubiST⁺⁺: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees, Distributed and Parallel Databases, v.14 n.3, p.221-254, November 2003
	C.-F. Yu , B. W. Wah, Efficient Branch-and-Bound Algorithms on a Two-Level Memory System, IEEE Transactions on Software Engineering, v.14 n.9, p.1342-1356, September 1988
	Pin-Kwang Eng , Beng Chin Ooi , Kian-Lee Tan, Indexing for progressive skyline computation, Data & Knowledge Engineering, v.46 n.2, p.169-201, August 2003
	A. H. H. Ngu , B. Harangsri , J. Shepherd, Query Size Estimation for Joins Using Systematic Sampling, Distributed and Parallel Databases, v.15 n.3, p.237-275, May 2004
	Lars Arge , Mark de Berg , Herman J. Haverkort , Ke Yi, The Priority R-tree: a practically efficient and worst-case optimal R-tree, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	David Taniar , J. Wenny Rahayu, Global parallel index for multi-processors database systems, Information Sciences: an International Journal, v.165 n.1-2, p.103-127, 3 September 2004
	Pentti A. Honkanen, Concurrency control and integrity preservation for the `RIM' DBMS, ACM SIGMIS Database, v.15 n.3, p.34-39, Spring 1984
	Ashraf Aboulnaga , Walid G. Aref, Window Query Processing in Linear Quadtrees, Distributed and Parallel Databases, v.10 n.2, p.111-126, September 2001
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990
	Hanan Samet, Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing, ACM Transactions on Database Systems (TODS), v.29 n.4, December 2004
	M. V. Ramakrishna, Bounded Disorder File Organization, IEEE Transactions on Knowledge and Data Engineering, v.6 n.1, p.79-85, February 1994
	Jayant R. Haritsa , S. Seshadri, Real-Time Index Concurrency Control, IEEE Transactions on Knowledge and Data Engineering, v.12 n.3, p.429-447, May 2000
	Gerth Stolting Brodal , Rolf Fagerberg, Lower bounds for external memory dictionaries, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Adina Crainiceanu , Prakash Linga , Johannes Gehrke , Jayavel Shanmugasundaram, P-tree: a p2p index for resource discovery applications, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, May 19-21, 2004, New York, NY, USA
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Journal of Algorithms, v.53 n.2, p.115-136, November 2004
	V. Srinivasan , Michael J. Carey, Performance of B⁺ tree concurrency control algorithms, The VLDB Journal — The International Journal on Very Large Data Bases, v.2 n.4, p.361-406, October 1993
	June S. Park , V. Sridhar, Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering, IEEE Transactions on Knowledge and Data Engineering, v.9 n.5, p.826-832, September 1997
	Kazuhiko Kato, Persistently Cached B-Trees, IEEE Transactions on Knowledge and Data Engineering, v.15 n.3, p.706-720, March 2003
	J. A. Orenstein , T. H. Merrett, A class of data structures for associative searching, Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, April 02-04, 1984, Waterloo, Ontario, Canada
	Kerttu Pollari-Malmi , Eljas Soisalon-Soininen , Tatu Ylönen, Concurrency Control in B-Trees with Batch Updates, IEEE Transactions on Knowledge and Data Engineering, v.8 n.6, p.975-984, December 1996
	Patrick Valduriez , Yann Viemont, A multikey hashing scheme using predicate trees, ACM SIGMOD Record, v.14 n.2, June 1984
	Lars Arge , Mark de Berg , Herman Haverkort, Cache-oblivious R-trees, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy
	Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Bradley C. Kuszmaul, Concurrent cache-oblivious b-trees, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
	Lars Arge , Gerth Stølting Brodal , Rolf Fagerberg , Morten Laustsen, Cache-oblivious planar orthogonal range searching and counting, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy
	Xiaowei Sun , Rui Wang , Betty Salzberg , Chendong Zou, Online B-tree merging, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
	Givon Zirkind, Genetic database optimization: how data inspection and consideration, provides for index compression and record access optimization of genetic databases, Proceedings of the 2006 ACM SIGMIS CPR conference on computer personnel research: Forty four years of computer personnel research: achievements, challenges & the future, April 13-15, 2006, Claremont, California, USA
	Vram Kouramajian , Ramez Elmasri, The TI/R--Tree: a temporal--spatial access structure, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina
	Sakti Pramanik , Myoung Ho Kim, Parallel Processing of large node B-trees, IEEE Transactions on Computers, v.39 n.9, p.1208-1212, September 1990
	Leonard J. Bass, The access method used in a scientific data management system, Proceedings of the 1st LBL Workshop on Statistical database management, p.296-297, December 02-04, 1981, Melno Park, California
	Adina Crainiceanu , Prakash Linga , Johannes Gehrke , Jayavel Shanmugasundaram, Querying peer-to-peer networks using P-trees, Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004, June 17-18, 2004, Paris, France
	Adrian Colbrook , Eric A. Brewer , Chrysanthos N. Dellarocas , William E. Weihl, Algorithms for Search Trees on Message-Passing Architectures, IEEE Transactions on Parallel and Distributed Systems, v.7 n.2, p.97-108, February 1996
	Michael A. Bender , Martin Farach-Colton , Bradley C. Kuszmaul, Cache-oblivious string B-trees, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 26-28, 2006, Chicago, IL, USA
	Sheau-Dong Lang , James R. Driscoll , Jiann H. Jou, A unified analysis of batched searching of sequential and tree-structured files, ACM Transactions on Database Systems (TODS), v.14 n.4, p.604-618, Dec. 1989
	Kesheng Wu , Ekow J. Otoo , Arie Shoshani, Optimizing bitmap indices with efficient compression, ACM Transactions on Database Systems (TODS), v.31 n.1, p.1-38, March 2006
	Nicholas Lester , Justin Zobel , Hugh Williams, Efficient online index maintenance for contiguous inverted lists, Information Processing and Management: an International Journal, v.42 n.4, p.916-933, July 2006
	Vincent C. H. Ma , Michael D. McCool, Low latency photon mapping using block hashing, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, September 01-02, 2002, Saarbrucken, Germany
	Bipen C. Desai, Performance of a Composite Attribute and Join Index, IEEE Transactions on Software Engineering, v.15 n.2, p.142-152, February 1989
	A. Corral , Y. Manolopoulos , Y. Theodoridis , M. Vassilakopoulos, Algorithms for processing K-closest-pair queries in spatial databases, Data & Knowledge Engineering, v.49 n.1, p.67-104, 1 April 2004
	Lars Arge , Michael A. Bender , Erik D. Demaine , Bryan Holland-Minkley , J. Ian Munro, Cache-oblivious priority queue and graph algorithm applications, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Paul W. H. Kwan , Junbin Gao, A multi-step strategy for approximate similarity search in image databases, Proceedings of the 17th Australasian Database Conference, p.139-147, January 16-19, 2006, Hobart, Australia
	Fay Chang , Jeffrey Dean , Sanjay Ghemawat , Wilson C. Hsieh , Deborah A. Wallach , Mike Burrows , Tushar Chandra , Andrew Fikes , Robert E. Gruber, Bigtable: A Distributed Storage System for Structured Data, ACM Transactions on Computer Systems (TOCS), v.26 n.2, p.1-26, June 2008
	C. D. Barranco , J. R. Campaòa , J. M. Medina, A B+-tree based indexing technique for fuzzy numerical data, Fuzzy Sets and Systems, v.159 n.12, p.1431-1449, June, 2008
	Walid G. Aref , Hanan Samet, Efficient Window Block Retrieval in Quadtree-Based Spatial Databases, Geoinformatica, v.1 n.1, p.59-91, April 1997
	S. Sioutas , L. Drossos , D. Tsolis , T. S. Papatheodorou, EST-grid: an efficient scalable peer-to-peer infrastructure for web service discovery, Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications, p.110-119, September 15-17, 2005, Malta
	Paris Kanellakis, Database querying and constraint programming, ACM SIGACT News, v.25 n.4, p.22-87, Dec. 1994
	Christopher Jermaine , Edward Omiecinski , Wai Gen Yee, The partitioned exponential file for database storage management, The VLDB Journal — The International Journal on Very Large Data Bases, v.16 n.4, p.417-437, October 2007
	Delis Vasilis , Makris Christos , Sioutas Spiros, A provably efficient computational model for approximate spatiotemporal retrieval, Proceedings of the 7th ACM international symposium on Advances in geographic information systems, p.40-46, November 02-06, 1999, Kansas City, Missouri, United States
	Byunggu Yu , Ratko Orlandic, Object and query transformation: supporting multi-dimensional queries through code reuse, Proceedings of the ninth international conference on Information and knowledge management, p.141-149, November 06-11, 2000, McLean, Virginia, United States
	Goetz Graefe, Implementing sorting in database systems, ACM Computing Surveys (CSUR), v.38 n.3, p.10-es, 2006
	Indira Subramanian , Cliff Mather , Kurt Peterson , Balakrishna Raghunath, Implementation of multiple pagesize support in HP-UX, Proceedings of the Annual Technical Conference on USENIX Annual Technical Conference, 1998, p.9-9, June 15-19, 1998, New Orleans, Louisiana
	Thomas Gschwind, PSTL: a C++ persistent standard template library, Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems, p.11-11, January 29-February 02, 2001, San Antonia, Texas
	Adam Sweeney , Doug Doucette , Wei Hu , Curtis Anderson , Mike Nishimoto , Geoff Peck, Scalability in the XFS file system, Proceedings of the Annual Technical Conference on USENIX 1996 Annual Technical Conference, p.1-1, January 22-26, 1996, San Diego, CA
	Andrew Heybey , Mark Sullivan , Paul England, Calliope: a distributed, scalable multimedia server, Proceedings of the Annual Technical Conference on USENIX 1996 Annual Technical Conference, p.7-7, January 22-26, 1996, San Diego, CA
	Wonik Choi , Dongseop Kwon , Sangjun Lee, Spatio-temporal data warehouses using an adaptive cell-based approach, Data & Knowledge Engineering, v.59 n.1, p.189-207, October 2006
	Goetz Graefe, B-tree indexes, interpolation search, and skew, Proceedings of the 2nd international workshop on Data management on new hardware, June 25-25, 2006, Chicago, Illinois
	Lars Arge , Norbert Zeh, Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
	Qun Chen , Andrew Lim , Kian Win Ong , Jiqing Tang, Indexing XML documents for XPath query processing in external memory, Data & Knowledge Engineering, v.59 n.3, p.681-699, December 2006
	Shuqiao Guo , Zhiyong Huang , H. V. Jagadish , Beng Chin Ooi , Zhenjie Zhang, Relaxed space bounding for moving objects: a case for the buddy tree, ACM SIGMOD Record, v.35 n.4, p.24-29, December 2006
	Pallavi Tadepalli, Grid-based distributed search structure, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida
	Alexander Ocsa , Ernesto Cuadros-Vargas, DBM*-Tree: an efficient metric access method, Proceedings of the 45th annual southeast regional conference, March 23-24, 2007, Winston-Salem, North Carolina
	Tuukka K. Haapasalo , Ibrahim M. Jaluta , Seppo S. Sippu , Eljas O. Soisalon-Soininen, Concurrency control and recovery for multiversion database structures, Proceeding of the 2nd PhD workshop on Information and knowledge management, October 30-30, 2008, Napa Valley, California, USA
	Fay Chang , Jeffrey Dean , Sanjay Ghemawat , Wilson C. Hsieh , Deborah A. Wallach , Mike Burrows , Tushar Chandra , Andrew Fikes , Robert E. Gruber, Bigtable: a distributed storage system for structured data, Proceedings of the 7th conference on USENIX Symposium on Operating Systems Design and Implementation, p.15-15, November 06-08, 2006, Seattle, WA
	Houman Alborzi , Hanan Samet, Execution time analysis of a top-down R-tree construction algorithm, Information Processing Letters, v.101 n.1, p.6-12, 16 January 2007
	Chin-Hsien Wu , Tei-Wei Kuo , Li Ping Chang, An efficient B-tree layer implementation for flash-memory storage systems, ACM Transactions on Embedded Computing Systems (TECS), v.6 n.3, p.19-es, July 2007
	Michael A. Olson , Keith Bostic , Margo Seltzer, Berkeley DB, Proceedings of the Annual Technical Conference on 1999 USENIX Annual Technical Conference, p.43-43, June 06-11, 1999, Monterey, California
	Muhammad Waseem Akhtar , M-Tahar Kechadi, A comparative study of peer to peer dynamic load balancing on embedded topologies, Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks, p.182-189, February 13-15, 2007, Innsbruck, Austria
	Antonio Corral , Jesús M. Almendros-Jiménez, A performance comparison of distance-based query algorithms using R-trees in spatial databases, Information Sciences: an International Journal, v.177 n.11, p.2207-2237, June, 2007
	Witold Litwin, Linear hashing: a new tool for file and table addressing, Proceedings of the sixth international conference on Very Large Data Bases, p.212-223, October 01-03, 1980, Montreal, Quebec, Canada
	David B. Lomet, Digital B-trees, Proceedings of the seventh international conference on Very Large Data Bases, p.333-344, September 09-11, 1981, Cannes, France
	Donald D. Chamberlin , A. M. Gilbert , Robert A. Yost, A history of system R and SQL/data system, Proceedings of the seventh international conference on Very Large Data Bases, p.456-464, September 09-11, 1981, Cannes, France
	Goetz Graefe, Write-optimized B-trees, Proceedings of the Thirtieth international conference on Very large data bases, p.672-683, August 31-September 03, 2004, Toronto, Canada
	Jingren Zhou , Kenneth A. Ross, Buffering accesses to memory-resident index structures, Proceedings of the 29th international conference on Very large data bases, p.405-416, September 09-12, 2003, Berlin, Germany
	Bernhard Zeller , Alfons Kemper, Experience report: exploiting advanced database optimization features for Large-Scale SAP R/3 installations, Proceedings of the 28th international conference on Very Large Data Bases, p.894-905, August 20-23, 2002, Hong Kong, China
	Flavio Chierichetti , Alessandro Panconesi , Prabhakar Raghavan , Mauro Sozio , Alessandro Tiberi , Eli Upfal, Finding near neighbors through cluster pruning, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 11-13, 2007, Beijing, China
	Michael A. Bender , Martin Farach-Colton , Jeremy T. Fineman , Yonatan R. Fogel , Bradley C. Kuszmaul , Jelani Nelson, Cache-oblivious streaming B-trees, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, June 09-11, 2007, San Diego, California, USA
	Byunggu Yu , Thomas Bailey, Processing partially specified queries over high-dimensional databases, Data & Knowledge Engineering, v.62 n.1, p.177-197, July, 2007
	Marios Hadjieleftheriou , Nick Koudas , Divesh Srivastava, Incremental maintenance of length normalized indexes for approximate string matching, Proceedings of the 35th SIGMOD international conference on Management of data, June 29-July 02, 2009, Providence, Rhode Island, USA
	Marios Hadjieleftheriou , Erik Hoel , Vassilis J. Tsotras, SaIL: A Spatial Index Library for Efficient Application Integration, Geoinformatica, v.9 n.4, p.367-389, December 2005
	Jan Lindström, T^link-tree: main memory index structure with concurrency control and recovery, Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology, p.533-538, April 02-04, 2007, Phuket, Thailand
	Feifei Li , Marios Hadjieleftheriou , George Kollios , Leonid Reyzin, Dynamic authenticated index structures for outsourced databases, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
	R. Braumandl , J. Claussen , A. Kemper , D. Kossmann, Functional-join processing, The VLDB Journal — The International Journal on Very Large Data Bases, v.8 n.3-4, p.156-177, February 2000
	Theo Härder , Joachim Reinert, Access path support for referential integrity in SQL2, The VLDB Journal — The International Journal on Very Large Data Bases, v.5 n.3, p.196-214, August 1996
	Beng Chin Ooi , Jiawei Han , Hongjun Lu , Kian Lee Tan, Index nesting – an efficient approach to indexing in object-oriented databases, The VLDB Journal — The International Journal on Very Large Data Bases, v.5 n.3, p.215-228, August 1996
	Beng Chin Ooi , Kian-Lee Tan , Tat Seng Chua , Wynne Hsu, Fast image retrieval using color-spatial information, The VLDB Journal — The International Journal on Very Large Data Bases, v.7 n.2, p.115-128, May 1998
	Georgios Evangelidis , David Lomet , Betty Salzberg, The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation, The VLDB Journal — The International Journal on Very Large Data Bases, v.6 n.1, p.1-25, February 1997
	Bingsheng He , Qiong Luo , Byron Choi, Adaptive Index Utilization in Memory-Resident Structural Joins, IEEE Transactions on Knowledge and Data Engineering, v.19 n.6, p.772-788, June 2007
	Philippe Bonnet, Making CSB+-Trees processor conscious, Proceedings of the 1st international workshop on Data management on new hardware, June 12-12, 2005, Baltimore, Maryland
	Jagannathan Srinivasan , Souripriya Das , Chuck Freiwald , Eugene Inseok Chong , Mahesh Jagannath , Aravind Yalamanchi , Ramkumar Krishnan , Anh-Tuan Tran , Samuel DeFazio , Jayanta Banerjee, Oracle8i Index-Organized Table and Its Application to New Domains, Proceedings of the 26th International Conference on Very Large Data Bases, p.285-296, September 10-14, 2000
	Brian Cooper , Neal Sample , Michael J. Franklin , Gisli R. Hjaltason , Moshe Shadmon, A Fast Index for Semistructured Data, Proceedings of the 27th International Conference on Very Large Data Bases, p.341-350, September 11-14, 2001
	Maurìcio R. Mediano , Marco A. Casanova , Marcelo Dreux, V-Trees - A Storage Method for Long Vector Data, Proceedings of the 20th International Conference on Very Large Data Bases, p.321-330, September 12-15, 1994
	Bernhard Seeger , Hans-Peter Kriegel, Techniques for Design and Implementation of Efficient Spatial Access Methods, Proceedings of the 14th International Conference on Very Large Data Bases, p.360-371, August 29-September 01, 1988
	Ratko Orlandic , John L. Pfaltz, Compact 0-Complete Trees, Proceedings of the 14th International Conference on Very Large Data Bases, p.372-381, August 29-September 01, 1988
	Tobin J. Lehman , Michael J. Carey, A Study of Index Structures for Main Memory Database Management Systems, Proceedings of the 12th International Conference on Very Large Data Bases, p.294-303, August 25-28, 1986
	Alexandra Poulovassilis , Carol Small, A Functional Programming Approach to Deductive Databases, Proceedings of the 17th International Conference on Very Large Data Bases, p.491-500, September 03-06, 1991
	Erik G. Hoel , Hanan Samet, Performance of Data-Parallel Spatial Operations, Proceedings of the 20th International Conference on Very Large Data Bases, p.156-167, September 12-15, 1994
	Hongjun Lu , Beng Chin Ooi , Kian-Lee Tan, On Spatially Partitioned Temporal Join, Proceedings of the 20th International Conference on Very Large Data Bases, p.546-557, September 12-15, 1994
	B. Sreenath , S. Seshadri, The hcC-tree: An Efficient Index Structure for Object Oriented Databases, Proceedings of the 20th International Conference on Very Large Data Bases, p.203-213, September 12-15, 1994
	Kian-Lee Tan , Pin-Kwang Eng , Beng Chin Ooi, Efficient Progressive Skyline Computation, Proceedings of the 27th International Conference on Very Large Data Bases, p.301-310, September 11-14, 2001
	Guido Moerkotte, Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing, Proceedings of the 24rd International Conference on Very Large Data Bases, p.476-487, August 24-27, 1998
	V. W. Setzer , Andrea Zisman, New Concurrency Control Algorithms for Accessing and Compacting B-Trees, Proceedings of the 20th International Conference on Very Large Data Bases, p.238-248, September 12-15, 1994
	T. V. Prabhakar , H. V. Sahasrabuddhe, Towards an Optimal Data-Structure: CB-trees, Proceedings of the 10th International Conference on Very Large Data Bases, p.235-244, August 27-31, 1984
	Cheng Hian Goh , Beng Chin Ooi , D. Sim , Kian-Lee Tan, GHOST: Fine Granularity Buffering of Indexes, Proceedings of the 25th International Conference on Very Large Data Bases, p.339-350, September 07-10, 1999
	Georgios Evangelidis , David B. Lomet , Betty Salzberg, The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation, Proceedings of the 21th International Conference on Very Large Data Bases, p.551-561, September 11-15, 1995
	Joseph M. Hellerstein , Jeffrey F. Naughton , Avi Pfeffer, Generalized Search Trees for Database Systems, Proceedings of the 21th International Conference on Very Large Data Bases, p.562-573, September 11-15, 1995
	Ramez Elmasri , Gene T. J. Wuu , Yeong-Joon Kim, The Time Index: An Access Structure for Temporal Data, Proceedings of the 16th International Conference on Very Large Data Bases, p.1-12, August 13-16, 1990
	Erik G. Hoel , Hanan Samet, Benchmarking Spatial Join Operations with Spatial Output, Proceedings of the 21th International Conference on Very Large Data Bases, p.606-618, September 11-15, 1995
	Marcel Kornacker, High-Performance Extensible Indexing, Proceedings of the 25th International Conference on Very Large Data Bases, p.699-708, September 07-10, 1999
	Arvola Chan , Sy Danberg , Stephen Fox , Wen-Te K. Lin , Anil Nori , Daniel R. Ries, Storage and Access Structures to Support a Semantic Data Model, Proceedings of the 8th International Conference on Very Large Data Bases, p.122-130, September 08-10, 1982
	André Eickler , Carsten Andreas Gerlhof , Donald Kossmann, A Performance Evaluation of OID Mapping Techniques, Proceedings of the 21th International Conference on Very Large Data Bases, p.18-29, September 11-15, 1995
	Giovanni Maria Sacco, Index Access with a Finite Buffer, Proceedings of the 13th International Conference on Very Large Data Bases, p.301-309, September 01-04, 1987
	Harry Leslie , Rohit Jain , Dave Birdsall , Hedieh Yaghmai, Efficient Search of Multi-Dimensional B-Trees, Proceedings of the 21th International Conference on Very Large Data Bases, p.710-719, September 11-15, 1995
	S. Misbah Deen, An Implementation of Impure Surrogates, Proceedings of the 8th International Conference on Very Large Data Bases, p.245-256, September 08-10, 1982
	H. V. Jagadish , Laks V. S. Lakshmanan , Divesh Srivastava, What can Hierarchies do for Data Warehouses?, Proceedings of the 25th International Conference on Very Large Data Bases, p.530-541, September 07-10, 1999
	Brajesh Goyal , Jayant R. Haritsa , S. Seshadri , V. Srinivasan, Index Concurrency Control in Firm Real-Time Database Systems, Proceedings of the 21th International Conference on Very Large Data Bases, p.146-157, September 11-15, 1995
	Jun Rao , Kenneth A. Ross, Cache Conscious Indexing for Decision-Support in Main Memory, Proceedings of the 25th International Conference on Very Large Data Bases, p.78-89, September 07-10, 1999
	Weidong Chen , Jyh-Herng Chow , You-Chin Fuh , Jean Grandbois , Michelle Jou , Nelson Mendonça Mattos , Brian T. Tran , Yun Wang, High Level Indexing of User-Defined Types, Proceedings of the 25th International Conference on Very Large Data Bases, p.554-564, September 07-10, 1999
	Michael Stonebraker , Joseph Kalash, TIMBER: A Sophisticated Relation Browser (Invited Paper), Proceedings of the 8th International Conference on Very Large Data Bases, p.1-10, September 08-10, 1982
	Vokan Akcelik , Jacobo Bielak , George Biros , Ioannis Epanomeritakis , Antonio Fernandez , Omar Ghattas , Eui Joong Kim , Julio Lopez , David O'Hallaron , Tiankai Tu , John Urbanic, High Resolution Forward And Inverse Earthquake Modeling on Terascale Computers, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, p.52, November 15-21, 2003
	Tiankai Tu , David R. O'Hallaron, A Computational Database System for Generatinn Unstructured Hexahedral Meshes with Billions of Elements, Proceedings of the 2004 ACM/IEEE conference on Supercomputing, p.25, November 06-12, 2004
	Julio C. Lopez , David R. O'Hallaron , Tiankai Tu, Big Wins with Small Application-Aware Caches, Proceedings of the 2004 ACM/IEEE conference on Supercomputing, p.20, November 06-12, 2004
	Mohamed Y. Eltabakh , Wing-Kai Hon , Rahul Shah , Walid G. Aref , Jeffrey S. Vitter, The SBC-tree: an index for run-length compressed sequences, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France
	Jayant R. Haritsa , S. Seshadri, Real-time index concurrency control, ACM SIGMOD Record, v.25 n.1, p.13-17, March 1996
	David Lomet, A review of recent work on multi-attribute access methods, ACM SIGMOD Record, v.21 n.3, p.56-63, Sept. 1992
	R. Maelbrancke , H. Olivié, Optimizing Jan Jannink's Implementation of B+-tree deletion, ACM SIGMOD Record, v.24 n.3, p.5-7, Sept. 1995
	Jan Jannink, Implementing deletion in B+-trees, ACM SIGMOD Record, v.24 n.1, p.33-38, March 1995
	Kian-Lee Tan , Beng Chin Ooi , Chia Yeow Yee, An Evaluation of Color-Spatial Retrieval Techniques for Large Image Databases, Multimedia Tools and Applications, v.14 n.1, p.55-78, May 2001
	I. A. R. Moghrabi , R. A. Makholian, A New Approach to Clustering Records in Information Retrieval Systems, Information Retrieval, v.3 n.2, p.105-126, July 2000
	VassilisJ. Tsotras , Vidyadhar Phalke , Anil Kumar , B. Gopinath, Supporting Temporal Views in a ManagementInformation Base, Journal of Network and Systems Management, v.7 n.2, p.149-176, June 01, 1999
	Guang-Ho Cha , Chin-Wan Chung, A New Indexing Scheme for Content-Based Image Retrieval, Multimedia Tools and Applications, v.6 n.3, p.263-288, May 1998
	Lars Arge, Worst-case efficient range search indexing: invited tutorial, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 29-July 01, 2009, Providence, Rhode Island, USA
	Jeffrey Scott Vitter, Algorithms and data structures for external memory, Foundations and Trends® in Theoretical Computer Science, v.2 n.4, p.305-474, January 2008
	Hanan Samet, A sorting approach to indexing spatial data, ACM SIGGRAPH 2008 classes, August 11-15, 2008, Los Angeles, California
	Steven W. Schlosser , Michael P. Ryan , Ricardo Taborda , Julio López , David R. O'Hallaron , Jacobo Bielak, Materialized community ground models for large-scale earthquake simulation, Proceedings of the 2008 ACM/IEEE conference on Supercomputing, November 15-21, 2008, Austin, Texas
	Bingsheng He , Qiong Luo, Cache-oblivious databases: Limitations and opportunities, ACM Transactions on Database Systems (TODS), v.33 n.2, p.1-42, June 2008
	Lars Arge , Gerth Stølting Brodal , S. Srinivasa Rao, External memory planar point location with logarithmic updates, Proceedings of the twenty-fourth annual symposium on Computational geometry, June 09-11, 2008, College Park, MD, USA
	Seon Ho Kim , Byunggu Yu , Jae-young Chang, Zoned-partitioning of tree-like access methods, Information Systems, v.33 n.3, p.315-331, May, 2008
	Dongwon Kang , Dawoon Jung , Jeong-Uk Kang , Jin-Soo Kim, μ-tree: an ordered index structure for NAND flash memory, Proceedings of the 7th ACM & IEEE international conference on Embedded software, September 30-October 03, 2007, Salzburg, Austria
	Lars Arge , Mark De Berg , Herman Haverkort , Ke Yi, The priority R-tree: A practically efficient and worst-case optimal R-tree, ACM Transactions on Algorithms (TALG), v.4 n.1, p.1-30, March 2008
	Lior Aronovich , Israel Spiegler, CM-tree: A dynamic clustered index for similarity search in metric databases, Data & Knowledge Engineering, v.63 n.3, p.919-946, December, 2007
	Fay Chang , Jeffrey Dean , Sanjay Ghemawat , Wilson C. Hsieh , Deborah A. Wallach , Mike Burrows , Tushar Chandra , Andrew Fikes , Robert E. Gruber, Bigtable: a distributed storage system for structured data, Proceedings of the 7th symposium on Operating systems design and implementation, November 06-08, 2006, Seattle, Washington
	Ohad Rodeh, B-trees, shadowing, and clones, ACM Transactions on Storage (TOS), v.3 n.4, p.1-27, February 2008
	Michael Morse , Jignesh M. Patel , William I. Grosky, Efficient evaluation of radial queries using the target tree, International Journal of Bioinformatics Research and Applications, v.3 n.1, p.24-41, December 2007
	I. Elizabeth Shanthi , Y. Izaaz , R. Nadarajan, On the SD-tree construction for optimal signature operations, Proceedings of the 1st Bangalore annual Compute conference, January 18-20, 2008, Bangalore, India
	Alan Sexton , Hayo Thielecke, Reasoning about B+ Trees with Operational Semantics and Separation Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 218, p.355-369, October, 2008
	Azzam Sleit, On using B⁺-tree for efficient processing for the boundary neighborhood problem, WSEAS TRANSACTIONS on SYSTEMS, v.7 n.7, p.711-720, July 2008
	Nicholas Lester , Alistair Moffat , Justin Zobel, Efficient online index construction for text databases, ACM Transactions on Database Systems (TODS), v.33 n.3, p.1-33, August 2008
	Baihua Zheng , Wang-Chien Lee , Dik Lun Lee, On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems, IEEE Transactions on Mobile Computing, v.6 n.7, p.748-761, July 2007
	S. Sioutas , K. Tsakalidis , K. Tsichlas , C. Makris , Y. Manolopoulos, A new approach on indexing mobile objects on the plane, Data & Knowledge Engineering, v.67 n.3, p.362-380, December, 2008
	Thierry Urruty, KpyrRec: a recursive multidimensional indexing structure, International Journal of Parallel, Emergent and Distributed Systems, v.23 n.3, p.235-245, June 2008
	HweeHwa Pang , Kyriakos Mouratidis, Authenticating the query results of text search engines, Proceedings of the VLDB Endowment, v.1 n.1, August 2008
	Morteza Zaker , Somnuk Phon-Amnuaisuk , Su-Cheng Haw, Investigating design choices between Bitmap index and B-tree index for a large data warehouse system, Proceedings of the 8th conference on Applied computer scince, p.123-130, November 21-23, 2008, Venice, Italy
	Peter Wegner , Edwin D. Reilly, Tree, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
	Hongchan Roh , Woo-Cheol Kim , Seungwoo Kim , Sanghyun Park, A B-Tree index extension to enhance response time and the life cycle of flash memory, Information Sciences: an International Journal, v.179 n.18, p.3136-3161, August, 2009
	Bhaskar Biswas , Karan Jain , K. K. Shukla, Efficient indexing of web pages using PR⁺ trees, Proceedings of the International Conference on Advances in Computing, Communication and Control, January 23-24, 2009, Mumbai, India
	Nikolas Askitis , Justin Zobel, B-tries for disk-based string management, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.1, p.157-179, January 2009
	Kyriakos Mouratidis , Dimitris Sacharidis , Hweehwa Pang, Partially materialized digest scheme: an efficient verification method for outsourced databases, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.1, p.363-381, January 2009
	Gary H. Sockut , Balakrishna R. Iyer, Online reorganization of databases, ACM Computing Surveys (CSUR), v.41 n.3, p.1-136, July 2009
	Pallavi Tadepalli , H. Conrad Cunningham, Incrementally distributed B+ trees: approaches and challenges, Proceedings of the 47th Annual Southeast Regional Conference, March 19-21, 2009, Clemson, South Carolina
	George H. L. Fletcher , Dirk Van Gucht , Yuqing Wu , Marc Gyssens , Sofía Brenes , Jan Paredaens, A methodology for coupling fragments of XPath with structural indexes for XML documents, Information Systems, v.34 n.7, p.657-670, November, 2009