WO1999003039A1 - Systeme de stockage/recherche de donnees - Google Patents
Systeme de stockage/recherche de donnees Download PDFInfo
- Publication number
- WO1999003039A1 WO1999003039A1 PCT/JP1998/003067 JP9803067W WO9903039A1 WO 1999003039 A1 WO1999003039 A1 WO 1999003039A1 JP 9803067 W JP9803067 W JP 9803067W WO 9903039 A1 WO9903039 A1 WO 9903039A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- block
- key
- primary
- record
- stored
- Prior art date
Links
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/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9017—Indexing; Data structures therefor; Storage structures using directory or table look-up
Definitions
- the present invention relates to data storage and reading by a computer, and can store and retrieve data at high speed and at a high storage rate, greatly reducing maintenance work, and relates to data management.
- Background art
- the conventional data storage method has many restrictions on its use, such as the fact that the physical positions of the blocks are continuous and that blocks must be created in advance for storage. .
- random access except for some methods, it is necessary to create an index, the creation time is long, and when performing update processing, the index is updated and the exclusion range Because of the widening of the dead zone, it had a structure that would easily cause deadlock.
- a high-speed storage / retrieval process can be performed by configuring a storage device using only a semiconductor or a semiconductor and a random access storage medium.
- the semiconductor can use a main storage device, or can be configured as an external storage device for the present invention.
- Data is stored in blocks sequentially, and if overflow occurs due to data insertion, it is stored using overflow blocking.
- a location table that manages storage blocks without using indexes Or by using an alternate key table and performing a search on it It enables high-speed storage and reading, has high data storage efficiency, and minimizes the occurrence of deadlock.
- the location table secures a necessary continuous area in advance.
- One record (entry) in the location table manages one primary block of data record storage area. Although it is possible to manage multiple primary blocks, the size of one primary block can be arbitrarily large, so you only need to change the size, and it is easier to manage without managing multiple blocks. .
- a block is composed of two types, primary and intelligent, but only the primary block is managed in the location table. Records are first stored in the primary block. If a record is inserted into the block and it can no longer be stored in that block, one bargain block for that block is allocated. If the overflow block can no longer be stored, one more bar overflow block is assigned.
- the smart flow block is managed as a subordinate block of the primary block, and is only pointed to from the primary block, not the location table.
- the overflow block is not managed by the location table, no record is inserted into the location table, the time required for rewriting the location table is minimized, and the location table can be rewritten by one record. Since only lock mode is used, even if exclusion occurs, the range can be minimized, and the possibility of deadlock is greatly reduced.
- a deadlock occurs because two different tasks on one computer lock two or more of the same resources in a different order.
- the probability decreases when the range is narrow.
- a traditional index consists of several levels. If the key of a record is changed when the required record is accessed and updated, the index is also changed.If this affects only the lowest index, the exclusion range is limited, but Depending on the case, it may affect the upper index. In this case, exclusion extends to a large number of records, and it takes time to update the index. Therefore, the exclusion takes a long time, which causes deadlocks to occur frequently.
- FIG. 1 shows the configuration of the location table and the final pointer. The number of each byte is for reference only and can be configured with a different length than this.
- Figure 2 shows the relationship between location tables and blocks.
- Figure 3 shows the structure of the alternate key table (one entry) and the alternate key block. The number of bytes is for reference only and can be configured with a different length.
- F ROM and T O are the minimum and maximum key values in the block. The key value of the alternate key block can have both or only one of them.
- Figure 4 shows the configuration of the block.
- Figure 5 shows the structure of the pre-alternate key block.
- Figure 6 shows the relationship between blocks and overflow blocks. For the sake of simplicity, the figure shows blocks in continuous areas, but it is not necessary that they be continuous areas.
- Figure 7 shows an example of keying sentence data. BEST MODE FOR CARRYING OUT THE INVENTION
- the records stored in this method are limited to records that have one unique primary key and zero or more non-unique keys (although there is no problem if they are unique). Is done. Records that do not have a unique key are not considered.
- append refers to storing records with a primary key that is greater than the primary key of the currently stored record
- insert refers to storing records with a primary key that is smaller than the largest primary key
- the location table is calculated in advance from the planned number of records to be stored, the block size, and the number of primary blocks per record in the location table, and secures a necessary and sufficient area as a continuous area.
- the size and number of blocks are determined so that one entry of the number of records to be stored can be stored for the number of blocks in the alternate key table, and a continuous area is reserved.
- the continuous area may become full and storage may not be possible. In such a case, an additional contiguous area is secured, and multiple contiguous areas are treated as if they were one contiguous area using the address translation table. It is possible to deal with situations where more than the number of records is stored.
- Figure 2 shows the relationship between the location table and the block.
- a location table corresponding to the planned number of records to be stored in each sub-range is created for each sub-range.
- Each of the location tables must be contiguous ( ⁇ , but not necessarily, but the location tables need not be contiguous.
- the alternate key table is a contiguous area of size for all records. Is effective for high-speed access, but it is also possible to set it up for each subrange.
- the last pointer is referred to in the exclusive mode, and it is determined whether the primary key is greater than the key value of the last pointer.
- the block number is 0, block number 0 in the location table is referred to in the exclusive mode, the physical position of block 0 is known, and block 0 at that physical position is read. If there is enough free space in that block, store the record, register the primary key in the last pointer, and release all exclusions. Hereinafter, additional storage is performed by the same operation.
- one primary block (block number 1) is secured in exclusive mode.
- Binary search is known as an example of a fast search method.
- the method of performing a binary search is described as an example.
- the method is to search for two division points, and if there is an overflow block in the primary block pointed to by the record, include the creativity block and one block, and add it to that block (the relevant block).
- the value of the primary key of the stored record (hereinafter abbreviated as the stored primary key value) is compared with the value of the primary key of the inserted record (hereinafter abbreviated as the inserted primary key value). If the inserted primary key value is greater than the minimum stored primary key value or less than the minimum stored primary key value for the next block, it is stored in that block.
- the value of the stored primary key of the block is compared with the value of the inserted block primary key. If the value of the inserted primary key is small, the value is forward; if not, the value is later. Find the two split points and perform the same operation to find the block that stores the record. If the location table is composed of multiple contiguous areas, a binary 'search cannot be performed as it is, but using the address translation table to treat it as if it were a continuous area It is possible to perform a search.
- the first or last primary key value in the location table for each subrange is compared first to find which subrange is of interest. After that, for the subrange, a binary search is performed in the same manner as above to find a corresponding block.
- the nth block it will be as follows. Find the position in the block where you want to insert the record. Since the records are arranged in the order of the primary keys, the insertion position is immediately before the record with the primary key larger than the inserted record. First, check for duplicate primary keys. If the data is duplicated, it cannot be stored, so it is processed as an error. If they do not overlap, the records (one or more) after the inserted record are shifted backward by exactly the size of the inserted record. At this time, if the shifted record fits in the block, the process is terminated.If not, one overflow block is cut out, a pointer is assigned from the primary block, and only necessary Store it in the Saichi Bar Flow Block. After that, the inserted record and the record following the inserted record are stored in the primary block. Figure 6 shows the logical relationship between one primary block and one overflow block.
- an overflow block already exists, it is only necessary that both the primary block and the overflow block can be stored together. In addition, there is a possibility that the area is not effectively used because only a part of the over-barf mouth-block is used. To prevent this, one primary flow block can be provided for multiple primary blocks. The size of the overflow block is the same as that of the primary block, but can be smaller than that of the primary block. It is also possible to point and use one overflow block from multiple primary blocks.
- the substitute key table is composed of a plurality of substitute key blocks, and is stored so that the entry is arranged in the order of the substitute keys in the substitute key block.
- the entry 1 in the alternate key table consists of the alternate key, the physical address of the block in which the record of the key value is stored, and the primary key of the record of the key value.
- the number of entries fluctuates as records are added or updated.However, as the number of entries increases, there is a high possibility that an entry will be inserted, and it is very unlikely that an additional type will occur . For this reason, the same management as the primary key cannot be performed successfully.
- the insertion can be processed efficiently by providing a certain free space when storing entries in the alternate key block.
- the number of initial records is smaller than the number of records to be finally stored, a large number of key flow blocks will be generated by key insertion. In this case, use a pre-alternate key-table.
- the pre-alternative key table has the same structure as the alternative key table, and the number of blocks is the number obtained by dividing the size of the number of alternative key block entries that can be stored by the block size. .
- the number of entries in the pre-alternate key table is equal to the number of alternate key tables, move the entry from the pre-alternate key table to the alternate key table.
- an alternate key block stores one entry in principle, but an entry with the same alternate key is stored in the same alternate key block. If the number of entries with the same substitute key is too large to store in the substitute key block, substitute key, overflow, and block are added and stored.
- the number of records to be finally stored is 100,000. If it is possible to store 100 entries in one alternate key block, 10,000 alternative key * blocks are required. Until the entry 1 reaches 10,000, it is stored in the pre-alternative key block, and when the entry reaches 10,000, the entry 1 is transferred to the alternative key block.
- a pre-alternative key table is provided in multiple stages.
- 100000 entries are stored in the pre-alternative key table, but since one block can store 100 entries, this is performed in two steps.
- the first pre-alternative key table manages 100 entries, and when the entry becomes 100, it is transferred to the second-stage pre-alternative key table.
- Fig. 5 shows a specific example of transfer.
- a two-stage pre-alternative key table is provided.
- the location table is searched for two division points, and if the primary block pointed to by the entry 1 has an overflow block, it is stored in that block (including the overflow block), including the overflow block.
- the stored primary key value the primary key value of the record
- the target primary key value the primary key value of the target record
- the target primary key value is greater than or equal to the minimum stored primary key value and less than the next block's stored primary key value—the minimum value, the target record exists in that block or its key
- the value record either does not exist on the file. Since the blocks are arranged in the order of the primary key, searching for the block allows you to detect the target record or check whether it exists in the file. If this judgment does not apply, the primary key value of the block is compared with the primary key value of the target record, and if the target primary key value is small, it is forward, otherwise it is divided backward. Find the point, do the same, and find the block that contains the record. Next, a search using an alternative key will be described. The search by the substitute key searches the substitute key table.
- a typical search method is a binary search, but this is omitted in the description of primary key search. Find an alternate key block that contains the desired alternate key. Further, a search is made for a desired alternative key entry in the alternative key block. The result is that the entry in that block is the same as for the primary key. Either it exists, or the record with the alternate key value does not exist in the file and there is no entry. If the alternative key block has the alternative key @ saichiichi bar flow block, both of them are searched.
- the physical block is accessed from the physical block number in that entry, and a record in the block that matches the primary key value in the entry is searched. Also, since the substitute key can be non-unique, look at the next entry in the substitute key block, and if the substitute key value is the same, search for a record for that entry and have the same key value. Run until there is no entry.
- Creation refers to the case where multiple records already exist in the file of this method and re-creation due to an increase in overflow block, the case of expanding from a backup medium to the medium to which this method is applied, and
- records stored by a method other than the storage method described in this method may be transferred to the method method, but any method can be used.
- the files are read sequentially in the order of the primary key using the calling method, and a sequential file is created.
- a sequential file is created in the same manner.
- a location table and an alternative key table are prepared.
- the number of entries in the location table is set as a continuous area by dividing the number of records to be stored by the number of records that can be stored in one block.
- An alternate key table is reserved for each type of alternate key.
- One type of alternative key block has the same size, and the number is obtained as follows. Find the number of entries (A) that can be stored in one alternate key block. The quotient obtained by dividing the number of records to be stored by A is the number of alternate key blocks.
- the alternate key first creates an alternate key entry from the record and stores it in the sequential file.
- the sort is performed in the order of the alternative keys, and the sorted entries are stored in the alternative key block.
- the replacement key entry is stored in the replacement key block, but the storage is calculated by dividing the number of created records by the number of records to be finally stored, and storing it in the replacement key block at a rate corresponding to the quotient. . This is because the generation of the substitute key is of the insertion type.
- the current key sets a key for a field stored at a specific position in a record, and has the same length and format, for example, a product code or a customer code.
- Fig. 7 it is possible to key irregular records.
- Random access using a primary key and an alternate key can be performed at high speed.
- the time required for creating (creating) a location table or alternative key block is shorter than that for creating an index.
- Blocks can be added until there is no more free physical space.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Software Systems (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)
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP98931014A EP0923030A4 (en) | 1997-07-11 | 1998-07-08 | DATA STORAGE / SEARCH SYSTEM |
US09/254,437 US6415375B2 (en) | 1997-07-11 | 1998-07-08 | Information storage and retrieval system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP21970097A JP3345628B2 (ja) | 1997-07-11 | 1997-07-11 | データ格納及び検索方法 |
JP9/219700 | 1997-07-11 |
Related Child Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/254,437 A-371-Of-International US6415375B2 (en) | 1997-07-11 | 1998-07-08 | Information storage and retrieval system |
US10/119,145 Division US6584555B2 (en) | 1997-07-11 | 2002-04-10 | Information storage and retrieval system |
US10/390,815 Division US6654868B2 (en) | 1997-07-11 | 2003-03-17 | Information storage and retrieval system |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1999003039A1 true WO1999003039A1 (fr) | 1999-01-21 |
Family
ID=16739604
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP1998/003067 WO1999003039A1 (fr) | 1997-07-11 | 1998-07-08 | Systeme de stockage/recherche de donnees |
Country Status (4)
Country | Link |
---|---|
US (3) | US6415375B2 (ja) |
EP (1) | EP0923030A4 (ja) |
JP (1) | JP3345628B2 (ja) |
WO (1) | WO1999003039A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005086003A1 (ja) * | 2004-03-08 | 2005-09-15 | Annex Systems Incorporated | データベース・システム |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6444072B1 (en) * | 1999-08-11 | 2002-09-03 | Southpac Trust International | Process for producing holographic material |
US7305400B2 (en) | 2000-03-09 | 2007-12-04 | The Web Access, Inc. | Method and apparatus for performing a research task by interchangeably utilizing a multitude of search methodologies |
JP2001356945A (ja) * | 2000-04-12 | 2001-12-26 | Anetsukusu Syst Kk | データバックアップ・リカバリー方式 |
US6697797B1 (en) | 2000-04-28 | 2004-02-24 | Micro Data Base Systems, Inc. | Method and apparatus for tracking data in a database, employing last-known location registers |
US8335779B2 (en) * | 2002-08-16 | 2012-12-18 | Gamroe Applications, Llc | Method and apparatus for gathering, categorizing and parameterizing data |
AU2003262065A1 (en) * | 2002-09-10 | 2004-04-30 | Annex Systems Incorporated | Database re-organizing system and database |
EP1564640A1 (en) * | 2002-10-21 | 2005-08-17 | Annex Systems Incorporated | Database accelerator |
JPWO2005103901A1 (ja) * | 2004-04-19 | 2008-03-13 | アネックスシステムズ株式会社 | コンピューター・システム |
US20060010122A1 (en) * | 2004-07-07 | 2006-01-12 | International Business Machines Corporation | System and method for improved database table record insertion and reporting |
US7965297B2 (en) * | 2006-04-17 | 2011-06-21 | Microsoft Corporation | Perfect hashing of variably-sized data |
US7523288B2 (en) * | 2006-09-06 | 2009-04-21 | Microsoft Corporation | Dynamic fragment mapping |
US7872648B2 (en) * | 2007-06-14 | 2011-01-18 | Microsoft Corporation | Random-access vector graphics |
WO2009144942A1 (ja) * | 2008-05-30 | 2009-12-03 | 日本電気株式会社 | データベースシステム、データベース管理方法、データベース構造およびコンピュータプログラム |
TWI428023B (zh) * | 2008-11-18 | 2014-02-21 | Ind Tech Res Inst | 解碼方法及裝置 |
JP5460486B2 (ja) * | 2010-06-23 | 2014-04-02 | インターナショナル・ビジネス・マシーンズ・コーポレーション | データをソートする装置及び方法 |
CN102495836B (zh) * | 2011-10-28 | 2013-07-10 | 宁波三星电气股份有限公司 | 累计用电量最后记录的查找方法 |
US9870416B2 (en) | 2014-04-24 | 2018-01-16 | International Business Machines Corporation | Method for rebalancing data partitions |
US10089342B2 (en) * | 2014-07-10 | 2018-10-02 | Sap Se | Main memory database management using page index vectors |
CN105426408B (zh) * | 2015-11-02 | 2019-03-08 | 北京锐安科技有限公司 | 一种多索引的数据处理方法及装置 |
US20170255565A1 (en) * | 2016-03-02 | 2017-09-07 | Intel Corporation | Method and apparatus for providing a contiguously addressable memory region by remapping an address space |
US11782875B2 (en) * | 2017-11-13 | 2023-10-10 | Weka.IO Ltd. | Directory structure for a distributed storage system |
US12045173B2 (en) * | 2020-04-18 | 2024-07-23 | International Business Machines Corporation | Stale data recovery using virtual storage metadata |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4571700A (en) * | 1983-06-16 | 1986-02-18 | International Business Machines Corporation | Page indexing system for accessing sequentially stored data representing a multi-page document |
US5860136A (en) * | 1989-06-16 | 1999-01-12 | Fenner; Peter R. | Method and apparatus for use of associated memory with large key spaces |
US5842224A (en) * | 1989-06-16 | 1998-11-24 | Fenner; Peter R. | Method and apparatus for source filtering data packets between networks of differing media |
US5490258A (en) * | 1991-07-29 | 1996-02-06 | Fenner; Peter R. | Associative memory for very large key spaces |
EP0410210A3 (en) * | 1989-07-24 | 1993-03-17 | International Business Machines Corporation | Method for dynamically expanding and rapidly accessing file directories |
US5555388A (en) * | 1992-08-20 | 1996-09-10 | Borland International, Inc. | Multi-user system and methods providing improved file management by reading |
US5826076A (en) * | 1994-05-13 | 1998-10-20 | Liant Software Corporation | Computer-based information access method and apparatus to permit SQL-based manipulation of programming language-specific data files |
JP3371044B2 (ja) * | 1994-12-28 | 2003-01-27 | 株式会社日立製作所 | ディスクアレイのための領域割り当て方法およびディスクアレイアクセス方法 |
US5613110A (en) * | 1995-01-05 | 1997-03-18 | International Business Machines Corporation | Indexing method and apparatus facilitating a binary search of digital data |
US6226728B1 (en) * | 1998-04-21 | 2001-05-01 | Intel Corporation | Dynamic allocation for efficient management of variable sized data within a nonvolatile memory |
US6212647B1 (en) * | 1998-06-02 | 2001-04-03 | Hewlett-Packard Company | Systems and methods to perform defect management to block addressable storage media |
US6401160B1 (en) * | 1999-03-31 | 2002-06-04 | Intel Corporation | Method and apparatus to permit adjustable code/data boundary in a nonvolatile memory |
-
1997
- 1997-07-11 JP JP21970097A patent/JP3345628B2/ja not_active Expired - Lifetime
-
1998
- 1998-07-08 EP EP98931014A patent/EP0923030A4/en not_active Ceased
- 1998-07-08 US US09/254,437 patent/US6415375B2/en not_active Expired - Fee Related
- 1998-07-08 WO PCT/JP1998/003067 patent/WO1999003039A1/ja not_active Application Discontinuation
-
2002
- 2002-04-10 US US10/119,145 patent/US6584555B2/en not_active Expired - Fee Related
-
2003
- 2003-03-17 US US10/390,815 patent/US6654868B2/en not_active Expired - Fee Related
Non-Patent Citations (1)
Title |
---|
YAMATANI M: "ILLUSTRATED COMPUTER SERIES 'INTRODUCTION TO FILE ORGANIZATION'", ILLUSTRATED COMPUTER SERIES. INTRODUCTION TO FILE ORGANIZATION, XX, XX, 30 July 1985 (1985-07-30), XX, pages 65 - 85, XP002917315 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005086003A1 (ja) * | 2004-03-08 | 2005-09-15 | Annex Systems Incorporated | データベース・システム |
Also Published As
Publication number | Publication date |
---|---|
JPH1131096A (ja) | 1999-02-02 |
US20020133686A1 (en) | 2002-09-19 |
US6415375B2 (en) | 2002-07-02 |
EP0923030A4 (en) | 2002-05-02 |
US6654868B2 (en) | 2003-11-25 |
JP3345628B2 (ja) | 2002-11-18 |
US20010011321A1 (en) | 2001-08-02 |
US6584555B2 (en) | 2003-06-24 |
US20030159015A1 (en) | 2003-08-21 |
EP0923030A1 (en) | 1999-06-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO1999003039A1 (fr) | Systeme de stockage/recherche de donnees | |
US9454318B2 (en) | Efficient data storage system | |
US7065619B1 (en) | Efficient data storage system | |
US7096227B2 (en) | Database utilities | |
CN109445702B (zh) | 一种块级数据去重存储*** | |
US7418544B2 (en) | Method and system for log structured relational database objects | |
CA2723731C (en) | Managing storage of individually accessible data units | |
JP4921865B2 (ja) | アドレス関連テーブル構造を持つスキップ・リスト | |
US20110004639A1 (en) | Method and Apparatus for Storing Data with Reduced Redundancy Using Data Clusters | |
WO2006094365A1 (en) | Method for storing data with reduced redundancy using data clusters | |
US10496612B2 (en) | Method for reliable and efficient filesystem metadata conversion | |
JP2000181768A (ja) | デ―タ格納検索方式 | |
WO2001025962A1 (en) | Database organization for increasing performance by splitting tables | |
KR102388458B1 (ko) | 데이터 키 값 변환 방법 및 장치 | |
Luan | TreeKV: efficient garbage collection and range query for key-value separated LSM-stores | |
CN115544149A (zh) | 基于HBase多端融合的小文件存储方法和*** | |
Macyna | Check for Bulk Loading of the Secondary Index in LSM-Based Stores for Flash Memory Wojciech Macyna () and Michal Kukowski Department of Computer Science, Faculty of Information and Communication Technology | |
Alom et al. | COMPRESSED DATABASE STRUCTURE TO MANAGE LARGE SCALE DATA IN A DISTRIBUTED ENVIRONMENT |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1998931014 Country of ref document: EP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 09254437 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 1998931014 Country of ref document: EP |
|
WWR | Wipo information: refused in national office |
Ref document number: 1998931014 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1998931014 Country of ref document: EP |