US8521776B2 - Accessing data in a multi-generation database - Google Patents

Accessing data in a multi-generation database Download PDF

Info

Publication number
US8521776B2
US8521776B2 US12/329,005 US32900508A US8521776B2 US 8521776 B2 US8521776 B2 US 8521776B2 US 32900508 A US32900508 A US 32900508A US 8521776 B2 US8521776 B2 US 8521776B2
Authority
US
United States
Prior art keywords
data
track
page
entry
database
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US12/329,005
Other languages
English (en)
Other versions
US20100145996A1 (en
Inventor
Ori Ben-Itzhak
Irit Cohen
Rivka Mayraz Matosevich
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US12/329,005 priority Critical patent/US8521776B2/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BEN-ITZHAK, ORI, COHEN, IRIT, MATOSEVICH, RIVKA MAYRAZ
Priority to JP2011538917A priority patent/JP5567585B2/ja
Priority to PCT/EP2009/063554 priority patent/WO2010063511A1/en
Priority to EP09740670A priority patent/EP2370912A1/en
Priority to CN200980148961.4A priority patent/CN102239489B/zh
Publication of US20100145996A1 publication Critical patent/US20100145996A1/en
Application granted granted Critical
Publication of US8521776B2 publication Critical patent/US8521776B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2477—Temporal data queries

Definitions

  • the present invention relates generally to databases and, more particularly, to accessing data in a multi-generation database.
  • a database refers to an organized collection of data stored in a data storage system managed by a database management system (DBMS).
  • DBMS database management system
  • the DBMS usually implements some type of synchronization to allow concurrent accesses to data in the database.
  • Synchronization may involve implementing a lock for each data in a database. If the locks are stored in high-speed memory, however, there may be scalability problems depending on the size of the database since high-speed memory tends to be small. On the other hand, storing the locks in a dedicated location in slow-access memory negatively impacts performance.
  • data is organized according to one or more generations, or periods of time.
  • One generation may end and another generation may begin at a checkpoint, at a restoration point, at the start of a particular operation, or at some other designated point in time.
  • each data there are multiple versions of each data, one for each generation.
  • Each version is associated with a generation such that the newest version may be identified by searching for the version associated with the most current generation.
  • searching all the versions for the version with the most current generation is inefficient and makes synchronization difficult.
  • the present disclosure is directed to systems and corresponding methods that facilitate accessing data in a multi-generation database.
  • a method for accessing data in a multi-generation database comprises receiving a request to access first data in the database, wherein the first data is located on a first page of the database; reading an entry corresponding to the first page to locate a first track on the first page to access a newest version of the data; acquiring a first lock to synchronize accesses to the first track; and determining that the first track stores the newest version of the data, in response to reading the entry while holding the first lock.
  • a system comprising one or more logic units.
  • the one or more logic units are configured to perform the functions and operations associated with the above-disclosed methods.
  • a computer program product comprising a computer useable medium having a computer readable program is provided. The computer readable program when executed on a computer causes the computer to perform the functions and operations associated with the above-disclosed methods.
  • FIG. 1 illustrates an exemplary database layout for a multi-generation database, in accordance with one or more embodiments.
  • FIG. 2 illustrates an exemplary page table to identify the newest version of data, in accordance with one embodiment.
  • FIG. 3 is a flow diagram of a method for reading data from a multi-generation database, in accordance with one embodiment.
  • FIG. 4 is a flow diagram of an exemplary method for identifying the newest version of data, in accordance with one embodiment.
  • FIG. 5 is a flow diagram of a method for writing data to a multi-generation database, in accordance with one embodiment.
  • FIG. 6 is a flow diagram of a method for advancing a page in a multi-generation database, in accordance with one embodiment.
  • FIGS. 7 and 8 are block diagrams of hardware and software environments in which a system of the present invention may operate, in accordance with one or more embodiments.
  • an exemplary multi-generation database 100 comprises one or more pages corresponding to data stored in the database 100 .
  • the database 100 may, for example, comprise N data such that there are N pages, one for each data.
  • Each page of data comprises one or more versions of the data, wherein each version of the data is located on a different track, or location, on the page.
  • page 1 may comprise versions A, B, and C located on tracks 1 , 2 , and 3 , respectively; and page 2 may comprise versions D, B, and C located on tracks 1 , 2 , and 3 , respectively.
  • the database 100 is managed by a DBMS 110 .
  • the DBMS 110 manages access to data in the database 100 .
  • the DBMS 110 may synchronize access to data by implementing a lock for each track of each page in the database 100 .
  • the lock may be shared by more than one access.
  • the lock is exclusive to one access.
  • the lock is stored on the track with the data so that one access is sufficient to access both the lock and the version of the data on the track, improving performance and providing scalability for large databases.
  • locks on the same page may be collectively treated as a single lock.
  • an exemplary page table 200 comprises one or more entries corresponding to one or more pages of the database 100 .
  • the page table 200 may comprise N entries corresponding to N pages of the database 100 .
  • Each of the entries refers to the track of the newest version of the data stored on the page associated with the entry.
  • different formats may be used to refer to a track.
  • a minimal number of bits are used to provide scalability for large databases.
  • approximately log 2 (N) bits may be used to refer to a track if there are N tracks on a page.
  • N log 2
  • the newest version of the data on page 1 , version C is located on track 3 ; and the newest version of the data on page 2 , version D, is located on track 1 . Since there are 3 tracks on a page, two bits are used to refer to a track. “00” is used to refer to track 1 , “01” is used to refer to track 2 , and “10” is used to refer to track 3 , for example.
  • the DBMS 110 receives a request to access data located on a first page of the database 100 (P 300 ). In response, the DBMS 110 reads an entry corresponding to the first page from page table 200 to locate a first track on the first page storing the newest version of the data (P 310 ). For example, if the DBMS 110 receives a request to access data from page 1 of the database 100 , the DBMS 110 reads entry 1 from page table 200 . In FIGS. 1 and 2 , entry 1 refers to track 3 storing version C of the data.
  • the DBMS 110 Upon locating the first track (i.e., the track designated by the corresponding entry in the page table), the DBMS 110 acquires a lock to synchronize accesses to the first track (P 320 ). The lock synchronizes accesses to the data such that the newest version of the data is located on the first track as long as the entry refers to the first track while the lock to the track is held. Once the lock to the first track is acquired, the corresponding entry in the page table is read a second time to determine whether the newest version of the data is still located on the first track (P 330 ).
  • the entry in the page table may change between the first reading and the second reading of the corresponding entry in the page table, if the first page comprising the data is advanced to a new generation after the first reading, but before acquiring the lock to the first track pointed to by the corresponding entry in the page table. Further details on advancing the page are provided below with reference to FIG. 6 . If the newest version of the data is still located on the first track (P 340 ), the DBMS returns the version of the data located on the first rack (P 350 ). If the newest version of the data is no longer located on the first track (P 340 ), the DBMS 110 releases the lock (P 360 ) and repeats P 310 through P 360 .
  • the DBMS 110 receives a request to read data located on a first page of the database 100 (P 400 ). Upon receiving the request, the DBMS 110 accesses a first track on the first page storing the newest version of the data (P 410 , P 300 - 350 ) and returns the newest version of the data (P 420 ). The DBMS 110 also releases the lock to the first track that was acquired during P 410 (P 430 ).
  • the DBMS 110 receives a request to update data located on a first page of the database 100 .
  • the DBMS 110 accesses a first track on the first page storing the newest version of the data (P 500 , P 300 - 350 ) and determines whether the first track is associated with the current generation (P 520 ).
  • the DBMS 110 may identify the current generation, for example, by checking recent transactions in a transaction log maintained by the DBMS 110 .
  • the DBMS 110 If the first track is associated with the current generation (P 520 ), the DBMS 110 writes to the first track, updating the newest version of the data (P 530 ), and then releases the lock to the first track (P 540 ), which was exclusively acquired during P 500 . Otherwise, the DBMS 110 advances the first page to the current generation (P 550 ) and writes to a second track on the first page, updating the newest version of the data (P 560 ). Advancing the first page, which includes creating a new version of the data on the second track and updating the page table 200 , is done atomically from a user perspective.
  • the DBMS 110 creates a copy of the newest version of the data (P 600 ). If an unused second track is available on the first page (P 610 ), the DBMS 110 stores the copy on the unused second track (P 620 ). Otherwise, the DBMS 110 stores the copy on a used second track by overwriting the oldest version of the data (P 630 ).
  • the oldest version of the data is located on the track to the right of the newest version of the data. For example, in FIG. 1 on page 2 , version B the oldest version is to the right of version D the newest version (due to overlap).
  • version C is the newest version of the data on page 1 , and the oldest version of the data is version A, located on track 1 (with no overlap).
  • the second track is associated with the current generation (P 640 ), and the lock synchronizing accesses to the second track is reset and exclusively acquired (P 650 ).
  • the copy of the newest version of the data stored on the second track becomes the newest version of the data.
  • the DBMS 110 updates the entry for the page in page table 200 (P 660 ) and releases the lock to the first track that was exclusively acquired during P 500 (P 670 ).
  • the DBMS 110 writes to the second track, updating the newly created newest version of the data (P 680 , P 560 ) and releases the lock to the second track (P 690 ). For example, if page 1 is advanced, page 1 of FIG. 1 and entry 1 of FIG. 2 become like page 2 of FIG. 1 and entry 2 of FIG. 2 .
  • the invention may be implemented either entirely in the form of hardware or entirely in the form of software, or a combination of both hardware and software elements.
  • database 100 and DBMS 110 may be included in a controlled computing system environment that can be presented largely in terms of hardware components and software code executed to perform processes that achieve the results contemplated by the system of the present invention.
  • a computing system environment in accordance with an exemplary embodiment is composed of a hardware environment 1110 and a software environment 1120 .
  • the hardware environment 1110 comprises the machinery and equipment that provide an execution environment for the software; and the software provides the execution instructions for the hardware as provided below.
  • the software elements that are executed on the illustrated hardware elements are described in terms of specific logical/functional relationships. It should be noted, however, that the respective methods implemented in software may be also implemented in hardware by way of configured and programmed processors, ASICs (application specific integrated circuits), FPGAs (Field Programmable Gate Arrays) and DSPs (digital signal processors), for example.
  • ASICs application specific integrated circuits
  • FPGAs Field Programmable Gate Arrays
  • DSPs digital signal processors
  • System software 1121 comprises control programs, such as the operating system (OS) and information management systems that instruct the hardware how to function and process information.
  • OS operating system
  • information management systems that instruct the hardware how to function and process information.
  • DBMS 110 is implemented as application software 1122 executed on one or more hardware environments to manage access to the database 100 .
  • Application software 1122 may comprise but is not limited to program code, data structures, firmware, resident software, microcode or any other form of information or routine that may be read, analyzed or executed by a microcontroller.
  • the invention may be implemented as computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system.
  • a computer-usable or computer-readable medium may be any apparatus that can contain, store, communicate, propagate or transport the program for use by or in connection with the instruction execution system, apparatus or device.
  • the computer-readable medium may be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium.
  • Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk.
  • Current examples of optical disks include compact disk read only memory (CD-ROM), compact disk read/write (CD-R/W) and digital video disk (DVD).
  • an embodiment of the application software 1122 may be implemented as computer software in the form of computer readable code executed on a data processing system such as hardware environment 1110 that comprises a processor 1101 coupled to one or more memory elements by way of a system bus 1100 .
  • the memory elements may comprise local memory 1102 , storage medial 1106 , and cache memory 1104 .
  • Processor 1101 loads executable code from storage media 1106 to local memory 1102 .
  • Cache memory 1104 provides temporary storage to reduce the number of times code is loaded from storage media 1106 for execution.
  • a user interface device 1105 e.g., keyboard, pointing device, etc.
  • a display screen 1107 can be coupled to the computing system either directly or through an intervening I/O controller 1103 , for example.
  • a communication interface unit 1108 such as a network adapter, may be also coupled to the computing system to enable the data processing system to communicate with other data processing systems or remote printers or storage devices through intervening private or public networks. Wired or wireless modems and Ethernet cards are a few of the exemplary types of network adapters.
  • hardware environment 1110 may not include all the above components, or may comprise other components for additional functionality or utility.
  • hardware environment 1110 can be a laptop computer or other portable computing device embodied in an embedded system such as a set-top box, a personal data assistant (PDA), a mobile communication unit (e.g., a wireless phone), or other similar hardware platforms that have information processing and/or data storage and communication capabilities.
  • PDA personal data assistant
  • mobile communication unit e.g., a wireless phone
  • communication interface 1108 communicates with other systems by sending and receiving electrical, electromagnetic or optical signals that carry digital data streams representing various types of information including program code.
  • the communication may be established by way of a remote network (e.g., the Internet), or alternatively by way of transmission over a carrier wave.
  • application software 1122 may comprise one or more computer programs that are executed on top of system software 1121 after being loaded from storage media 1106 into local memory 1102 .
  • application software 1122 may comprise client software and server software.
  • client software is executed on a general computing system and server software is executed on a server system.
  • Software environment 1120 may also comprise browser software 1126 for accessing data available over local or remote computing networks. Further, software environment 1120 may comprise a user interface 1124 (e.g., a Graphical User Interface (GUI)) for receiving user commands and data.
  • GUI Graphical User Interface
  • logic code programs, modules, processes, methods and the order in which the respective steps of each method are performed are purely exemplary. Depending on implementation, the steps can be performed in any order or in parallel, unless indicated otherwise in the present disclosure. Further, the logic code is not related, or limited to any particular programming language, and may comprise of one or more modules that execute on one or more processors in a distributed, non-distributed or multiprocessing environment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Fuzzy Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
US12/329,005 2008-12-05 2008-12-05 Accessing data in a multi-generation database Expired - Fee Related US8521776B2 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US12/329,005 US8521776B2 (en) 2008-12-05 2008-12-05 Accessing data in a multi-generation database
JP2011538917A JP5567585B2 (ja) 2008-12-05 2009-10-16 複数世代データベース内のデータに対するアクセス
PCT/EP2009/063554 WO2010063511A1 (en) 2008-12-05 2009-10-16 Accessing data in a multi-generation database
EP09740670A EP2370912A1 (en) 2008-12-05 2009-10-16 Accessing data in a multi-generation database
CN200980148961.4A CN102239489B (zh) 2008-12-05 2009-10-16 访问多代数据库中的数据的方法和系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US12/329,005 US8521776B2 (en) 2008-12-05 2008-12-05 Accessing data in a multi-generation database

Publications (2)

Publication Number Publication Date
US20100145996A1 US20100145996A1 (en) 2010-06-10
US8521776B2 true US8521776B2 (en) 2013-08-27

Family

ID=41353855

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/329,005 Expired - Fee Related US8521776B2 (en) 2008-12-05 2008-12-05 Accessing data in a multi-generation database

Country Status (5)

Country Link
US (1) US8521776B2 (ja)
EP (1) EP2370912A1 (ja)
JP (1) JP5567585B2 (ja)
CN (1) CN102239489B (ja)
WO (1) WO2010063511A1 (ja)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230153282A1 (en) * 2021-11-15 2023-05-18 International Business Machines Corporation Chaining version data bi-directionally in data page to avoid additional version data accesses

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106682005A (zh) * 2015-11-05 2017-05-17 华为技术有限公司 一种确定数据库热页面的方法及装置

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5043876A (en) 1988-05-27 1991-08-27 International Business Machines Corporation N-level file shadowing and recovery in a shared file system
US5778388A (en) 1994-09-19 1998-07-07 Hitachi, Ltd. Method of processing a synchronization point in a database management system to assure a database version using update logs from accumulated transactions
US6351753B1 (en) 1998-02-20 2002-02-26 At&T Corp. Method and apparatus for asynchronous version advancement in a three version database
US6684226B1 (en) 2000-03-24 2004-01-27 Frontline Software Aps Method for storing data in one or more files so that both previous and new versions of the data are separately accessible
US7143120B2 (en) 2004-05-03 2006-11-28 Microsoft Corporation Systems and methods for automated maintenance and repair of database and file systems
US7297000B1 (en) 2003-11-26 2007-11-20 Hinsdale Bernard Periodic table of the elements in three dimensional form
US7779039B2 (en) 2004-04-02 2010-08-17 Salesforce.Com, Inc. Custom entities and fields in a multi-tenant database system
US8121992B2 (en) * 2007-04-02 2012-02-21 Bmc Software, Inc. Log data store and assembler for large objects in database system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0659953A (ja) * 1992-05-21 1994-03-04 Nec Corp 仮想ファイル入出力制御方法
ATE262196T1 (de) * 1996-08-02 2004-04-15 Hewlett Packard Co Verfahren und gerät das verteilte steuerung von gemeinsamen betriebsmitteln erlaubt
JP2003263350A (ja) * 2002-03-07 2003-09-19 Ricoh Co Ltd データベースシステム
US8762331B2 (en) * 2004-06-29 2014-06-24 Microsoft Corporation Concurrent transactions and page synchronization
JP2006085539A (ja) * 2004-09-17 2006-03-30 Fujitsu Ltd データベース管理プログラム、方法、装置及び記録媒体

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5043876A (en) 1988-05-27 1991-08-27 International Business Machines Corporation N-level file shadowing and recovery in a shared file system
US5778388A (en) 1994-09-19 1998-07-07 Hitachi, Ltd. Method of processing a synchronization point in a database management system to assure a database version using update logs from accumulated transactions
US6351753B1 (en) 1998-02-20 2002-02-26 At&T Corp. Method and apparatus for asynchronous version advancement in a three version database
US6684226B1 (en) 2000-03-24 2004-01-27 Frontline Software Aps Method for storing data in one or more files so that both previous and new versions of the data are separately accessible
US7297000B1 (en) 2003-11-26 2007-11-20 Hinsdale Bernard Periodic table of the elements in three dimensional form
US7779039B2 (en) 2004-04-02 2010-08-17 Salesforce.Com, Inc. Custom entities and fields in a multi-tenant database system
US7143120B2 (en) 2004-05-03 2006-11-28 Microsoft Corporation Systems and methods for automated maintenance and repair of database and file systems
US8121992B2 (en) * 2007-04-02 2012-02-21 Bmc Software, Inc. Log data store and assembler for large objects in database system

Non-Patent Citations (9)

* Cited by examiner, † Cited by third party
Title
Lomet, David et al, "Recovery from "Bad" User Transactions", ACM, 2 Penn Plaza, Suite 701, New York, NY, USA, 2006, pp. 337-346.
Lomet, David et al, "Transaction Time Support Inside a Database Engine", Data Engineering, 2006, CDE '06, Proceedings of the 22nd International Conference on Atlanta, GA, USA, Apr. 3-7, 2006, Piscataway, NJ, USA, IEEE, Apr. 3, 2006, pp. 1-12.
Ozsoyoglu, Gultekin et al, "Temporal and Real-Time Databases: A Survey", IEEE Transactions on Knowledge and Data Engineering, 1995, USA, pp. 513-532.
Russell Sears and Eric Brewer; University of California, Berkeley; "Stasis: Flexible Transactional Storage", to appear in OSDI 2006 SourceURL-http://www.cs.berkeley.edu/~sears/publications/Stasis-OSDI.pdf.
Russell Sears and Eric Brewer; University of California, Berkeley; "Stasis: Flexible Transactional Storage", to appear in OSDI 2006 SourceURL—http://www.cs.berkeley.edu/˜sears/publications/Stasis-OSDI.pdf.
Sanjay Ghemawat, "The Modified Object Buffer: A Storage Management Technique for Object-Oriented Databases", Ph.D Thesis submitted to MIT, Sep. 1995. http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-666.pdf.
Sanjay Ghemawat; "The Modified Object Buffer: A Storage Management Technique for Object-Oriented Databases", Ph.D. Thesis submitted to MIT. http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-666.pdf.
Sears et al., "Statis: Flexible Transactional Storage", OSDI 2006 Paper, pp. 29-44 of the proceedings. http://www.cs.berkeley.edu/~sears/publications/Statis-OSDI.pdf.
Sears et al., "Statis: Flexible Transactional Storage", OSDI 2006 Paper, pp. 29-44 of the proceedings. http://www.cs.berkeley.edu/˜sears/publications/Statis-OSDI.pdf.

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230153282A1 (en) * 2021-11-15 2023-05-18 International Business Machines Corporation Chaining version data bi-directionally in data page to avoid additional version data accesses
US12086118B2 (en) * 2021-11-15 2024-09-10 International Business Corporation Machines Chaining version data bi-directionally in data page to avoid additional version data accesses

Also Published As

Publication number Publication date
US20100145996A1 (en) 2010-06-10
JP2012511197A (ja) 2012-05-17
CN102239489A (zh) 2011-11-09
WO2010063511A1 (en) 2010-06-10
CN102239489B (zh) 2014-05-21
JP5567585B2 (ja) 2014-08-06
EP2370912A1 (en) 2011-10-05

Similar Documents

Publication Publication Date Title
US9965497B2 (en) Moving data between partitions
US20180218023A1 (en) Database concurrency control through hash-bucket latching
US8396833B2 (en) Inode management in redirect-on-write file system
US9542279B2 (en) Shadow paging based log segment directory
US20180121471A1 (en) Read and delete input/output operation for database management
US10185630B2 (en) Failure recovery in shared storage operations
US11003540B2 (en) Method, server, and computer readable medium for index recovery using index redo log
US10929216B2 (en) Application crash analysis techniques when memory dump and debug symbols are not co-located
US20220382712A1 (en) Minimizing data volume growth under encryption changes
US10083192B2 (en) Deleted database record reuse
US11853284B2 (en) In-place updates with concurrent reads in a decomposed state
US11704216B2 (en) Dynamically adjusting statistics collection time in a database management system
US8521776B2 (en) Accessing data in a multi-generation database
US8484171B2 (en) Duplicate filtering in a data processing environment
US9563519B2 (en) Reversing changes executed by change management
US20180276122A1 (en) Asynchronous garbage collection in parallel transaction system without locking
US10303680B2 (en) Data processing apparatus and data processing method
US20190303037A1 (en) Using sequential read intention to increase data buffer reuse
US10706012B2 (en) File creation
US20170169049A1 (en) Staging Log-Based Page Blobs on a Filesystem

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION,NEW YO

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BEN-ITZHAK, ORI;COHEN, IRIT;MATOSEVICH, RIVKA MAYRAZ;SIGNING DATES FROM 20081208 TO 20081210;REEL/FRAME:022088/0347

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BEN-ITZHAK, ORI;COHEN, IRIT;MATOSEVICH, RIVKA MAYRAZ;SIGNING DATES FROM 20081208 TO 20081210;REEL/FRAME:022088/0347

REMI Maintenance fee reminder mailed
LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.)

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Expired due to failure to pay maintenance fee

Effective date: 20170827