US20010011278A1 - Data structure in database, database system for managing database and database managing method and system - Google Patents

Data structure in database, database system for managing database and database managing method and system Download PDF

Info

Publication number
US20010011278A1
US20010011278A1 US09/044,163 US4416398A US2001011278A1 US 20010011278 A1 US20010011278 A1 US 20010011278A1 US 4416398 A US4416398 A US 4416398A US 2001011278 A1 US2001011278 A1 US 2001011278A1
Authority
US
United States
Prior art keywords
data
database
state
time series
time
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.)
Abandoned
Application number
US09/044,163
Other languages
English (en)
Inventor
Takayoshi Shimokawa
Kazuo Masai
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.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Assigned to HITACHI, LTD. reassignment HITACHI, LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MASAI, KAZUO, SHIMOKAWA, TAKAYOSHI
Publication of US20010011278A1 publication Critical patent/US20010011278A1/en
Priority to US10/084,222 priority Critical patent/US7225178B2/en
Abandoned legal-status Critical Current

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/21—Design, administration or maintenance of databases
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing

Definitions

  • the present invention relates to a time series database processing system of especially ultra-large scale for storing data pieces serving as updating detailed information in sequence of time series in a database and for controlling addition/deletion/retrieval of data.
  • indexing is effective when an item serving as a key during retrieval can be specified.
  • the indexing is a contrivance in which specified key items of a database are collected, a pointer is provided over the key items to take the form of a balanced tree (B tree), and the tree can be traced at a high speed up to a location corresponding to a leaf of the tree in accordance with information indicating which range a key of a specified value lies in.
  • B tree balanced tree
  • a utility for data loading uses a technique for writing data directly to a physical area of a database and therefore, with this utility, data can be written at a high speed.
  • the utility for high-speed data loading generally inhibits direct data write to the physical area during data loading from conflicting area at other retrieval or updating access.
  • data load shall compulsorily be executed while inhibiting access to a specified table for retrieval/updating or a part of a table for retrieval/updating. This forces retrieval of the database to be once stopped each time that time series data added almost every day is loaded. In a database of ultra-large scale, it takes one day or more for retrieval per se in some applications.
  • An object of the invention is to provide method and system which can eliminate conflict of the operation of time series data loading and data deletion with the operation of data retrieval in a database system and which can mitigate suppression imposed on retrieval by the system.
  • Another object of the invention is to provide a database managing system which can dispense with reorganization of an index tree which loses balance owing to addition of time series data.
  • a database managing method for managing data pieces in a database comprising the steps of:
  • the method further comprises the steps of:
  • the state transition information included in the detected bookmark information indicates either a value indicative of the loading state or a value indicative of the empty state, it can be decided that the data retrieval request is not responded to.
  • the method further comprises the steps of:
  • the method further comprises the steps of:
  • bookmark information having bookmark information indicative of a time corresponding to the data piece for the predetermined time and state transition information indicative of a state of the data piece for the predetermined time and loading resulting data pieces in the plurality of data areas in the database in sequence of times corresponding to the time series data pieces.
  • a data structure realized in a database comprises:
  • a predetermined bookmark information area having bookmark information indicative of a time corresponding to a time series data piece loaded in each of the data areas and state transition information indicative of a state of the data piece in each data area
  • the state transition information has one of a value indicative of an online state in which the data area is permitted to be retrieved and a value indicative of a loading state in which loading of data in the data area has not yet been completed and the data area is not permitted to be retrieved.
  • the data pieces are arranged consecutively in the database while having a predetermined data capacity so that the plurality of bookmark information areas in the plurality of data areas may be read consecutively.
  • the database is divided into segments which are each minimum blocks for storage area management and time series data pieces are stored in the segments.
  • a time at which the data is loaded is stored as a bookmark at a predetermined location in a start segment from which the addition starts with the database. Thanks to the bookmark, when retrieval of time designation or time interval designation is carried out, the retrieval range can be narrowed physically by utilizing the bookmark.
  • the database can be brought into a loading unfinished state by locating the bookmark in other place than the place in which the data is being loaded. Consequently, data can be loaded directly on a physical segment without affecting other retrieval.
  • the bookmark is written in the above other place and the database is recognized by such assigning a bookmark thereto.
  • the present invention is effective for a computer system having a database and especially for a database system for retrieval in which data pieces reach the database system in sequence of time series and data change other than addition or insertion and deletion of time series data is not carried out.
  • FIG. 1 is a diagram showing indices of a tree which loses balance owing to addition/deletion of time series data.
  • FIG. 2 is a diagram showing an embodiment of system construction according to the present invention.
  • FIG. 3 is a diagram showing the construction of an embodiment of a storage apparatus of the present invention.
  • FIG. 4 is a diagram for explaining a bookmark information area.
  • FIG. 5 is a flow chart of an embodiment of the retrieval processing.
  • FIG. 6 is a diagram showing the state of the storage apparatus to explain the flow chart of FIG. 4.
  • FIG. 7 is a flow chart showing an embodiment of the data load processing.
  • FIG. 8 is a diagram showing the state of the storage apparatus in mid course to explain the flow chart of FIG. 6.
  • FIG. 9 is a diagram showing the final state of the storage apparatus to explain the flow chart of FIG. 6.
  • FIG. 10 is a flow chart of an embodiment of the deletion processing.
  • FIG. 11 is a diagram showing the state of the storage apparatus in mid course to explain the flow chart of FIG. 9.
  • FIG. 12 is a diagram showing the construction of the storage apparatus to explain an embodiment of a wraparound architecture.
  • FIG. 13 is a diagram showing the construction of another embodiment of the storage apparatus of the present invention.
  • FIG. 2 there is illustrated an embodiment of system construction according to the present invention.
  • a database system principally comprises a database system apparatus 10 having a central processing unit (CPU) 11 and a storage apparatus 13 for physically storing data.
  • a database management program 12 operates on the system apparatus 10 to store actual data from a cumulative data area 8 onto the storage apparatus 13 .
  • Provided in the storage apparatus 13 are a data area 14 and a system definition information area 15 for storing definition information of data.
  • the area 8 may have a data entity area 8 A and an empty area 8 B in order to store time series data pieces for a predetermined time and transfer the stored data to the storage apparatus 13 .
  • the construction of the storage apparatus is shown in greater detail to give a detailed explanation of the system definition information area 15 and data area 14 .
  • the data area 14 has consecutive areas secured on the storage apparatus 13 so as to be divided into management blocks called segments 20 .
  • Data pieces generated in time series fashion are put together in the area 8 by means of the management program 12 until they reach an amount for a constant time.
  • the collected data pieces are stored in one of the management block segments of the consecutive areas of the database in the form of the storage apparatus 13 , along with a time for storage which is read out of a clock 9 and stored in the same segment or otherwise at a different location.
  • the segment 20 includes, for example, a data storage area 21 for storing real data and a bookmark information area 22 for storing management information for the data stored in the data storage area 21 .
  • the segment 20 consists of a plurality of pages each being a unit of disk input/output.
  • the system definition information 15 has information for managing the storage location of time series data, including information for pointing a segment 20 which is the oldest in time series and information for pointing the start of an empty segment area.
  • the bookmark information area includes a time information area 23 for storing information concerning a time which is specific to data stored in the segment 20 and which is delivered out of the clock 9 and a status flag area 24 for storing status flag information indicative of a shifting or transition state (to be described below) of the segment 20 .
  • the shifting or transition state is classified into three states or modes including “online” indicating that the data storage area is accessible, “loading” indicating that data is now being inserted and “empty” indicating that no data is present in the data storage area.
  • the status of the segment 20 shifts from one mode or state to another.
  • time series database retrieval for which time is specified is frequently practiced. For example, the title and the date of issue of a book published by a publisher are stored in time series fashion in a time series database of the publisher by using the issue date as a key and an instance will be described hereunder in which the database is retrieved for a list of titles of books issued over three months which range from March, 1994 to May, 1994.
  • FIG. 5 is a flow chart showing an embodiment of the retrieval processing in the present embodiment
  • FIG. 6 is a diagram showing the state of the storage apparatus useful to explain the flow chart of FIG. 5.
  • information for pointing a segment 20 which stores the oldest data in time series is first acquired from the system definition information 15 (step 500 ). Then, the database system acquires time information t (February, 1994) and status information (online) from a bookmark information area 22 of the pointed segment 20 (step 501 ). Acquisition of the system definition information is carried out at a high speed because a predetermined capacity of data can be acquired starting with the start of a plurality of segments arrayed at equi-capacity intervals on the database.
  • the acquired status information is “empty” or “loading”
  • the data to be retrieved has not been stored in the segment 20 or data is now being inserted in the segment 20 and hence it is determined that access is impossible and the retrieval processing ends (step 502 ).
  • step 503 If the status information is “online”, access is permitted and the program proceeds to the next process (step 503 ).
  • the posterior retrieval request time ( May, 1994) is compared with the time information (February, 1994) stored in the bookmark information area 22 to decide whether the intended data is stored in the database. If the result of comparison is “Yes”, in a test whether the stored newer data is newer than the range of the retrieval object (March, 1994 to May, 1994), the retrieval processing ends.
  • “No” is issued in the decision process, the program proceeds to the next process (step 504 ) to decide whether the segment 20 now pointed is within the retrieval request time (March, 1994 to May, 1994).
  • this data storage area 21 is excluded from the retrieval object and a segment 20 for storing data which succeeds in terms of time series is pointed (step 506 ).
  • a segment 20 for storing data which succeeds in terms of time series is pointed (step 506 ).
  • the succeeding segment can be pointed by moving the size of segment (a moving amount relative to the magnetic head) starting from the header of the present disk.
  • step 504 the decision process like the above (steps 502 , 503 and 504 ) is executed.
  • step 504 data is read out of the corresponding data storage area 21 in the segment 20 (step 505 ). Since the header of the disk points the start of a segment 20 which stores the next data in terms of time series after the data has been read out of the data storage area 21 (step 506 ), time information is again acquired from a bookmark information area 22 and thereafter, the decision is repeated in a similar way. In this manner, the segments 20 are sequentially read. Since in the decision process (step 503 ) of a segment 20 the segment is determined to be outside the retrieval object, the retrieval processing ends at that time.
  • FIG. 7 is a flow chart showing the data load processing in the present embodiment.
  • data pieces of from July, 1994 to August, 1994 are loaded from the system apparatus to the database, that is, data loading is carried out. It is now assumed that data pieces to be inputted in the form of files have already been sorted in terms of time series. The following description will be given by referring to an example where data is added to the initial state illustrated in FIG. 6.
  • empty segment information is read out of the system definition information 15 (step 600 ). An empty segment 20 is pointed by that information.
  • the input file is accessed and data (July, 1994) is read (step 602 ). Because of the presence of the data, “presence” is determined in the process (step 602 ) and the program proceeds to the process (step 603 ).
  • a write process is executed. Firstly, the time, information (July, 1994) is written at the time information area and a flag “loading” indicating currently loading at the status flag area in the bookmark information area 22 , and data is written into the data storage area 21 . After completion of write, a state as shown in FIG. 8 prevails.
  • the database system After write of data for one segment has been terminated, the database system reads the next input data from the file (step 601 ). Because of the presence of data for August, 1994, “presence” is determined in the decision process (step 602 ). Through the same logic as that used for writing the data for July, 1994, time information (August, 1994), a status flag “loading” and data are written at the time information area 23 , status flag area 24 and data storage area 21 in a segment 20 (step 603 ).
  • step 601 After completion of write, the system is about to read the next data from the file (step 601 ). But, since data has already been absent in the file, “absence” is determined in the decision process (step 602 ) and the program proceeds to the next process (step 604 in FIG. 7).
  • the database system After write of the input data to the database has been finished, the database system starts updating the status flag in the bookmark information area in order to make the segments written with the new data accessible (step 604 ).
  • the database system reads the empty segment information 16 in the system definition information 15 and points a segment 20 which has initially been written with the new data. Since in that segment 20 the status flag in the bookmark area 22 is set with “loading”, this flag is shifted to “online”. This permits that segment to be retrieved.
  • the size of segment is defined as in the case of retrieval and therefore, a segment 20 stored with the next information in time series fashion can be pointed.
  • the shift or transition processing from “loading” to “online” ends when the status flag of the read bookmark information area indicates “empty” and address information for that segment is set in the empty segment information 16 in the system definition information 15 (step 605 ).
  • a state in which the data load processing is thoroughly completed is shown in FIG. 9.
  • FIG. 10 is a flow chart showing an embodiment of the deletion processing.
  • the state shown in FIG. 6 is considered as the initial state and the segment 20 for February, 1994 is deleted.
  • start segment information 16 is read out of the system definition information 15 (step 700 ).
  • Time information (February, 1994) is acquired from the bookmark information area 22 of the segment 20 and it is decided whether the segment 20 is one which is an object to be deleted (step 701 ).
  • time information is set to the bookmark information area 22 (step 703 ) and “empty” is set to the status flag (step 704 ).
  • the segment 20 can be shifted to an inaccessible state.
  • a segment 20 which is next in terms of time series is pointed (step 705 ) and time information (March, 1994) is acquired from the bookmark information area 22 of that segment 20 .
  • the acquired time information (March, 1994) is compared with February, 1994 for the deletion object and it is determined that the segment 20 is not the deletion object (step 701 ), thus ending the deletion processing.
  • the database assumes a state as shown in FIG. 11.
  • the segments are used in wrap-around fashion to attain an advantage that no reorganization is needed even when addition/deletion is repeated. Finally, the wraparound architecture will be described.
  • a method of wrap-around which uses the respective segments temporally cyclically can be realized by setting a “start” flag 26 and a start address area 25 in the bookmark information area 22 of each segment 20 .
  • “1” is set in the “start” flag 26 and an address of a start one 20 of the segments is set in the start address area 25 .
  • this setting can be realized easily by adding a process of jumping to the start address on the extension of the retrieval/deletion/insertion processing because the processing of referring to the bookmark information area is always employed in the retrieval/deletion/insertion processing.
  • a database is shown which always holds data of the latest six months in a minimal segment capacity.
  • FIG. 13 shows an embodiment of the present invention which meets this case.
  • a system is available in which bookmark information pieces are stored in a bookmark information area 22 in the system definition information 15 so as to undergo centralized control. This system is more practical because it has such a merit that the area to be written with data is not limited by the bookmark information area and the respective segments need not have capacities which are matched to the same value.
  • the intended data can be accessed without resort to index by retrieving thoroughly only the specified control information storage range without retrieving the whole of the database.
  • data loading can be accomplished at a very high speed without stopping retrieval by temporarily making addition of data to a different empty segment in advance and at the time of completion of the data loading, assigning the data with a bookmark in the form of a table of the database.
  • a segment to be deleted in connection with deletion of data for which a constant time is exceeded, can be specified by retrieving the bookmark and the segment is a unit of area management of the database so that the area may be emptied, with the result that deletion can be accomplished within a very short time (typically, approximately several seconds to several minutes).
  • the scale of the bookmark information can be small as compared to the data amount which is very large, thus ensuring that the maintenance processing can be realized very easily and the bookmark information can be retrieved within a very short time even in a large-scale database.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
US09/044,163 1997-03-19 1998-03-19 Data structure in database, database system for managing database and database managing method and system Abandoned US20010011278A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/084,222 US7225178B2 (en) 1997-03-19 2002-02-28 Data structure in database, database system for managing database and database managing method and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP09-065919 1997-03-19
JP9065919A JPH10260876A (ja) 1997-03-19 1997-03-19 データベースのデータ構造及びデータベースのデータ処理方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US10/084,222 Continuation US7225178B2 (en) 1997-03-19 2002-02-28 Data structure in database, database system for managing database and database managing method and system

Publications (1)

Publication Number Publication Date
US20010011278A1 true US20010011278A1 (en) 2001-08-02

Family

ID=13300869

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/044,163 Abandoned US20010011278A1 (en) 1997-03-19 1998-03-19 Data structure in database, database system for managing database and database managing method and system
US10/084,222 Expired - Fee Related US7225178B2 (en) 1997-03-19 2002-02-28 Data structure in database, database system for managing database and database managing method and system

Family Applications After (1)

Application Number Title Priority Date Filing Date
US10/084,222 Expired - Fee Related US7225178B2 (en) 1997-03-19 2002-02-28 Data structure in database, database system for managing database and database managing method and system

Country Status (2)

Country Link
US (2) US20010011278A1 (ja)
JP (1) JPH10260876A (ja)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2568399A3 (en) * 2011-09-09 2013-07-10 Onzo Limited Data storage method and system
US8825583B2 (en) 2009-12-18 2014-09-02 Onzo Limited Utility data processing system
US8843332B2 (en) 2009-11-12 2014-09-23 Onzo Limited Method and apparatus for noise reduction and data compression
US9483737B2 (en) 2011-05-18 2016-11-01 Onzo Limited Identifying an event associated with consumption of a utility

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4159151B2 (ja) * 1998-10-21 2008-10-01 Ｎｅｃエンジニアリング株式会社 アラーム履歴記録装置
US7155450B2 (en) * 2001-05-10 2006-12-26 Automsoft R & D Limited Plant information management system
US8874561B2 (en) * 2003-03-31 2014-10-28 Sap Se Time series data management
EP1770544A3 (en) * 2004-05-03 2007-05-09 LG Electronics Inc. Method and apparatus for managing bookmark information for content stored in a network media server
JP4082614B2 (ja) * 2004-11-12 2008-04-30 インターナショナル・ビジネス・マシーンズ・コーポレーション データベース管理システム、データベース管理方法、及びプログラム
JP4813155B2 (ja) * 2005-11-17 2011-11-09 三菱電機株式会社 データ管理装置、データ管理装置のデータ管理方法およびデータ管理プログラム
JP4148529B2 (ja) * 2006-12-28 2008-09-10 インターナショナル・ビジネス・マシーンズ・コーポレーション データベースにおける索引の整合性をチェックするためのシステム、方法およびプログラム
US7487184B1 (en) 2008-05-09 2009-02-03 International Business Machines Corporation Method, system, and computer program product for improved round robin for time series data
GB2489147A (en) 2009-12-25 2012-09-19 Ibm System, method and program for checking consistency of pointers in hierarchical database
JP5354606B2 (ja) * 2010-02-10 2013-11-27 日本電信電話株式会社 データ蓄積装置及び方法及びプログラム及びデータ検索装置及び方法及びプログラム
EP2515246B1 (en) 2011-04-18 2013-10-23 Qualtera Data processing method and device

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4646229A (en) 1982-11-15 1987-02-24 At&T Bell Laboratories Time-ordered data base
US4648036A (en) 1985-03-06 1987-03-03 At&T Bell Laboratories Method for controlling query and update processing in a database system
US4823310A (en) * 1987-08-10 1989-04-18 Wang Laboratories, Inc. Device for enabling concurrent access of indexed sequential data files
US4961134A (en) 1988-07-15 1990-10-02 International Business Machines Corporation Method for minimizing locking and reading in a segmented storage space
US4954981A (en) 1988-09-16 1990-09-04 Coworks Method and apparatus for accessing and manipulating time series
US5261069A (en) 1990-08-13 1993-11-09 Hewlett-Packard Company Method of maintaining consistency of cached data in a database system
US5289397A (en) * 1991-07-22 1994-02-22 Itt Corporation High-speed modulo exponentiator device
JPH0581049A (ja) 1991-09-20 1993-04-02 Fujitsu Ltd メモリの時間管理方式
US5280612A (en) 1991-11-26 1994-01-18 International Business Machines Corporation Multiple version database concurrency control system
JP3612339B2 (ja) * 1992-10-23 2005-01-19 株式会社日立製作所 データ処理方法および装置
US5361202A (en) * 1993-06-18 1994-11-01 Hewlett-Packard Company Computer display system and method for facilitating access to patient data records in a medical information system
US5481296A (en) 1993-08-06 1996-01-02 International Business Machines Corporation Apparatus and method for selectively viewing video information
JPH08152976A (ja) 1994-11-28 1996-06-11 Fujitsu Ltd 記憶装置のアクセス方法
US5835915A (en) 1995-01-24 1998-11-10 Tandem Computer Remote duplicate database facility with improved throughput and fault tolerance
JPH08212019A (ja) * 1995-01-31 1996-08-20 Mitsubishi Electric Corp 半導体ディスク装置
US5748952A (en) * 1995-05-10 1998-05-05 International Business Machines Corporation System and method for avoiding complete index tree traversals in sequential and almost sequential index probes
US5933820A (en) 1996-05-20 1999-08-03 International Business Machines Corporation System, method, and program for using direct and indirect pointers to logically related data and targets of indexes
US5878410A (en) 1996-09-13 1999-03-02 Microsoft Corporation File system sort order indexes
US6012060A (en) * 1997-05-30 2000-01-04 Oracle Corporation Sharing, updating data blocks among multiple nodes in a distributed system

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8843332B2 (en) 2009-11-12 2014-09-23 Onzo Limited Method and apparatus for noise reduction and data compression
US8874623B2 (en) 2009-11-12 2014-10-28 Onzo Limited Data storage and transfer
US8825583B2 (en) 2009-12-18 2014-09-02 Onzo Limited Utility data processing system
US9483737B2 (en) 2011-05-18 2016-11-01 Onzo Limited Identifying an event associated with consumption of a utility
EP2568399A3 (en) * 2011-09-09 2013-07-10 Onzo Limited Data storage method and system

Also Published As

Publication number Publication date
US20020091675A1 (en) 2002-07-11
US7225178B2 (en) 2007-05-29
JPH10260876A (ja) 1998-09-29

Similar Documents

Publication Publication Date Title
US5893120A (en) Methods and apparatus for information storage and retrieval using a hashing technique with external chaining and on-the-fly removal of expired data
US7225178B2 (en) Data structure in database, database system for managing database and database managing method and system
US6023744A (en) Method and mechanism for freeing disk space in a file system
CA2209549C (en) Method and apparatus for loading data into a database in a multiprocessor environment
KR930002331B1 (ko) 키 레코드를 페치, 삽입 및 삭제하는 방법
CN1026631C (zh) 利用索引树对数据库记录进行并发存取的方法
CN1020014C (zh) 快速开启由路径名识别的磁盘文件的方法
RU2182360C2 (ru) Способ обращения к данным, хранимым в компьютерной системе, способ архивирования данных и компьютерная система для осуществления способов
EP1342173B1 (en) Database management system and method for databases having large objects
US5790848A (en) Method and apparatus for data access and update in a shared file environment
CN101278289B (zh) 提供对象以支持worm存储设备中的数据结构的系统和方法
US5053948A (en) File index system for mass storage device
US6584555B2 (en) Information storage and retrieval system
US20070168640A1 (en) Method for searching a data page for inserting a data record
JP4101410B2 (ja) タイムバージョンデータ記憶装置
US20080162591A1 (en) Method of Logging Transactions and a Method of Reversing a Transaction
US6029229A (en) Digital data storage subsystem including directory for efficiently providing formatting information for stored records
US7016911B2 (en) Management of user-defined routine libraries in database environments
AU664763B2 (en) Entity-relation database
EP1850250A1 (en) Method and system for renewing an index
US5666527A (en) System for dynamically changing logical data structure of database
US5978810A (en) Data management system and method for storing a long record in a set of shorter keyed records
JPH03116248A (ja) データベースのデータ保全方式
CN118069365A (zh) 一种面向分布式图数据库的数据快速装载方法、系统、设备及存储介质
KR100205950B1 (ko) 다사용자용 저장시스템에서 테이블 래치와 항목 래치를 이용한 테이블 형태 데이타에 대한 동시성 제어 방법

Legal Events

Date Code Title Description
AS Assignment

Owner name: HITACHI, LTD., JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHIMOKAWA, TAKAYOSHI;MASAI, KAZUO;REEL/FRAME:009048/0386

Effective date: 19980306

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION