<?xml version='1.0' encoding='ISO-8859-1' ?>

<?xml-stylesheet href='../style/IndexTermsPage.xsl' type='text/xsl'?>
<!--
  XML-Page generated by PENELOPE.
  1999 Araneus Group and University 'Roma Tre', Rome, ITALY
-->
<!DOCTYPE IndexTermsPage SYSTEM '../DTD/IndexTermsPage.dtd'>

<IndexTermsPage>

 <title ArticleCode="101015">A High Performance, Universal, Key Associative Access Method.</title>
 <authors>
 <author AuthorPosition="00">David B. Lomet</author>
 </authors>
 <confName>ACM SIGMOD Conference</confName>
 <confYear>1983</confYear>
 <volume>13</volume>
 <number>4</number>
 <initPage>120</initPage>
 <endPage>133</endPage>
 <fullText >
 	<size></size>
 </fullText>
 <abstract>A new file organization is proposed that combines the advantages of digital B-trees and extendible hashing methods into one organization that can be used universally. The method, like these predecessors, relies on digital searching. The key notions are: (</abstract>
 <generalTerms></generalTerms>
 <categoryAndSubjectDescriptors></categoryAndSubjectDescriptors>
</IndexTermsPage>


