Log in
Enquire now
‌

US Patent 7603336 Peephole DBMS reorganization allowing concurrent data manipulation

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent

Patent attributes

Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
7603336
Date of Patent
October 13, 2009
Patent Application Number
11313117
Date Filed
December 19, 2005
Patent Primary Examiner
‌
Tim T Vo
Patent abstract

A method, apparatus and program storage device readable by a computer tangibly embodying a program of instructions executable by the computer is provided for reorganization of database data. The computer database reorganization method reorganizes one set of database data blocks at a time, allowing concurrent data manipulation. Method identifies a set of data blocks for reorganization in a sliding peephole mode, re-orders the set of data blocks and replaces the original set of data blocks with the re-ordered set of data blocks. The method include an overlapping peephole method, which chooses, for each set of data block to be reorganized, a next succeeding set of data blocks plus an overlap segment, wherein the overlap segment includes a set of empty pages other than intentionally specified free pages, and the overlap segment is a subset of the preceding set of data blocks.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 7603336 Peephole DBMS reorganization allowing concurrent data manipulation

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us