<?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="108055">Access Method Concurrency with Recovery.</title>
 <authors>
 <author AuthorPosition="01">Betty Salzberg</author>
 <author AuthorPosition="00">David B. Lomet</author>
 </authors>
 <confName>ACM SIGMOD Conference</confName>
 <confYear>1992</confYear>
 <volume>21</volume>
 <number>2</number>
 <initPage>351</initPage>
 <endPage>360</endPage>
 <fullText href="http://www.acm.org/pubs/articles/proceedings/mod/130283/p351-lomet/p351-lomet.pdf">
 	<size>958 KB</size>
 </fullText>
 <abstract>Providing high concurrency in B+-trees has been studied extensively. But few efforts have been documented for combining concurrency methods with a recovery scheme that preserves well-formed trees across system crashes. We describe an approach for this tha</abstract>
 <generalTerms>
 <term>Data, DATA STRUCTURES, Trees.</term>
 <term>Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.</term>
 <term>Information Systems, DATABASE MANAGEMENT, Systems, Concurrency.</term>
 </generalTerms>
 <categoryAndSubjectDescriptors>
  <categoryAndSubjectDescriptorsTuple>
 <category>E.1</category>
 <content>Data, DATA STRUCTURES, Trees.</content>
  </categoryAndSubjectDescriptorsTuple>

  <categoryAndSubjectDescriptorsTuple>
 <category>H.2.2</category>
 <content>Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.</content>
  </categoryAndSubjectDescriptorsTuple>

  <categoryAndSubjectDescriptorsTuple>
 <category>H.2.4</category>
 <content>Information Systems, DATABASE MANAGEMENT, Systems, Concurrency.</content>
  </categoryAndSubjectDescriptorsTuple>

 </categoryAndSubjectDescriptors>
</IndexTermsPage>


