INFORMATION STORAGE AND RETRIEVAL SYSTEM

• US 20100057685A1
• Filed: 09/02/2008
• Published: 03/04/2010
• Est. Priority Date: 09/02/2008
• Status: Abandoned Application

• Current Assignee: Qimonda AG (Infineon Technologies AG)
• Original Assignee: Qimonda AG (Infineon Technologies AG)
• Inventors: Luhn, Gerhard, Harter, Johann, Kreupl, Franz
• Application Number:
  US12/202,869
• Publication Number:
  US 20100057685A1
• Time in Patent Office: Days
• US Class Current: N/A
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/93 Document management systems

Abstract

An information storage and retrieval system includes a first data structure and a second data structure. The first data structure is configured to store documents. Each document includes a plurality of data portions. The second data structure is configured to store addresses to each document and data portion stored in the first data structure at addresses defined by an identity of each data portion.

Claims

1. An information storage and retrieval system comprising:

a first data structure configured to store documents, each document including a plurality of data portions; and

a second data structure configured to store addresses to each document and data portion stored in the first data structure at addresses defined by an identity of each data portion.

2. The system of claim 1, further comprising:

a system configured to;

receive a first document;

identify a first data portion of the first document;

write the first data portion to the first data structure at a free first address;

and

update the second data structure at the address defined by the identity of the first data portion by writing the first address for the first data portion in a free field.

3. The system of claim 1, further comprising:

a client configured to access a document including a search term, the client configured to;

directly access the second data structure at an address defined by an identity of the search term to receive a first address for the search term; and

directly access a first document in the first data structure at the first address for the search term.

4. The system of claim 3, wherein the client is configured to:

directly access the second data structure at the address defined by the identity of the search term to receive a second address for the search term; and

directly access a second document in the first data structure at the second address for the search term.

5. The system of claim 1, further comprising:

a client configured to access a document including a first search term and a second search term, the client configured to;

directly access the second data structure at an address defined by an identity of the first search term to receive first addresses for the first search term;

directly access the second data structure at an address defined by an identity of the second search term to receive second addresses for the second search term; and

directly access a first document in the first data structure at an address where a document address portion of a first address for the first search term equals a document address portion of a first address for the second search term.

6. The system of claim 1, further comprising:

a client configured to access a document including a phrase including a first term directly followed by a second term, the client configured to;

directly access the second data structure at an address defined by an identity of the first search term to receive first addresses for the first search term;

directly access the second data structure at an address defined by an identity of the second search term to receive second addresses for the second search term; and

directly access a first document in the first data structure at an address where a first address for the first term plus one equals a first address for the second term.

7. An information storage and retrieval system comprising:

a first data structure configured to store a plurality of documents, each document including a plurality of words, each usage of each word stored at its own first address;

a second data structure configured to store the first addresses for each word in a record at a second address, each second address associated with one word; and

a third data structure configured to store each second address in a record at an address defined by a coded value of the one word associated with each second address.

8. The system of claim 7, further comprising:

a processor configured to;

receive a first document;

identify a first word of the first document;

write the first word to the first data structure at a free first address;

determine whether the first word is associated with a second address;

determine a free second address in the second data structure and store the free second address in a record of the third data structure at an address defined by a coded value of the first word in response to determining that the first word is not associated with a second address;

directly access the third data structure at the address defined by the coded value of the first word to receive the second address associated with the first word; and

update the second data structure at the second address associated with the first word by writing the first address for the first word in a free field.

9. The system of claim 7, further comprising:

a client configured to access a document including a search term, the client configured to;

directly access the third data structure at an address defined by a coded value of the search term to receive a second address associated with the search term;

directly access the second data structure at the second address associated with the search term to receive a first address for the search term; and

directly access a first document in the first data structure at the first address for the search term.

10. The system of claim 9, wherein the client is configured to:

directly access the second data structure at the second address associated with the search term to receive a second first address for the search term; and

directly access a second document in the first data structure at the second first address for the search term.

11. The system of claim 7, further comprising:

a client configured to access a document including a first search term and a second search term, the client configured to;

directly access the third data structure at an address defined by a coded value of the first search term to receive a second address associated with the first search term;

directly access the third data structure at an address defined by a coded value of the second search term to receive a second address associated with the second search term;

directly access the second data structure at the second address associated with the first search term to receive first addresses for the first search term;

directly access the second data structure at the second address associated with the second search term to receive first addresses for the second search term; and

directly access a first document in the first data structure at an address where a document address portion of a first address for the first search term equals a document address portion of a first address for the second search term.

12. The system of claim 7, further comprising:

a client configured to access a document including a phrase including a first term directly followed by a second term, the client configured to;

directly access the third data structure at an address defined by a coded value of the first term to receive a second address associated with the first term;

directly access the third data structure at an address defined by a coded value of the second term to receive a second address associated with the second term;

directly access the second data structure at the second address associated with the first term to receive first addresses for the first term;

directly access the second data structure at the second address associated with the second term to receive first addresses for the second term; and

directly access a first document in the first data structure at an address where a first address for the first term plus one equals a first address for the second term.

13. A method for storing and retrieving information, the method comprising:

storing a plurality of documents in a first data structure, each document including a plurality of data portions; and

storing addresses to each document and data portion stored in the first data structure in a second data structure at addresses defined by an identity of each data portion.

14. The method of claim 13, further comprising:

receiving a first document;

identifying a first data portion of the first document;

writing the first data portion to the first data structure at a free first address; and

updating the second data structure at an address defined by the identity of the first data portion by writing the first address for the first data portion in a free field.

15. The method of claim 13, further comprising:

directly accessing the second data structure at an address defined by an identity of a search term to receive a first address for the search term; and

directly accessing a first document in the first data structure at the first address for the search term.

16. The method of claim 15, further comprising:

directly accessing the second data structure at the address defined by the identity of the search term to receive a second address for the search term; and

directly accessing a second document in the first data structure at the second address for the search term.

17. The method of claim 13, further comprising:

directly accessing the second data structure at an address defined by an identity of a first search term to receive first addresses for the first search term;

directly accessing the second data structure at an address defined by an identity of a second search term to receive second addresses for the second search term; and

directly accessing a first document in the first data structure at an address where a document address portion of a first address for the first search term equals a document address portion of a second address for the second search term.

18. The method of claim 13, further comprising:

directly accessing the second data structure at an address defined by an identity of a first search term to receive first addresses for the first search term;

directly accessing the second data structure at an address defined by an identity of a second search term to receive second addresses for the second search term; and

directly accessing a first document in the first data structure at an address where a first address for the first term plus an offset given by a length of the first search term plus one equals a second address for the second term.

19. The method of claim 13, wherein storing addresses to each document and data portion stored in the first data structure comprises storing addresses to each document and data portion stored in the first data structure at addresses defined by a coded value for each data portion.

20. A method for storing and retrieving information, the method comprising:

storing a plurality of documents in a first data structure, each document including a plurality of words, the storing including storing each usage of each word at its own first address;

storing the first addresses for each word in a record at a second address in a second data structure, each second address associated with one word; and

storing each second address in a record at an address defined by a coded value for the one word associated with each second address in a third data structure.

21. The method of claim 20, further comprising:

receiving a first document;

identifying a first word of the first document;

writing the first word to the first data structure at a free first address;

determining whether the first word is associated with a second address;

determining a free second address in the second data structure and storing the free second address in a record of the third data structure at an address defined by a coded value of the first word in response to determining that the first word is not associated with a second address;

directly accessing the third data structure at the address defined by the coded value of the first word to receive the second address associated with the first word; and

updating the second data structure at the second address associated with the first word by writing the first address for the first word in a free field.

22. The method of claim 20, further comprising:

directly accessing the third data structure at an address defined by a coded value of a search term to receive a second address associated with the search term;

directly accessing the second data structure at the second address associated with the search term to receive a first address for the search term; and

directly accessing a first document in the first data structure at the first address for the search term.

23. The method of claim 22, further comprising:

directly accessing the second data structure at the second address associated with the search term to receive a second first address for the search term; and

directly accessing a second document in the first data structure at the second first address for the search term.

24. The method of claim 20, further comprising:

directly accessing the third data structure at an address defined by a coded value of a first search term to receive a second address associated with the first search term;

directly accessing the third data structure at an address defined by a coded value of a second search term to receive a second address associated with the second search term;

directly accessing the second data structure at the second address associated with the first search term to receive first addresses for the first search term;

directly accessing the second data structure at the second address associated with the second search term to receive first addresses for the second search term; and

directly accessing a first document in the first data structure at an address where a document address portion of a first address for the first search term equals a document address portion of a first address for the second search term.

25. The method of claim 20, further comprising:

directly accessing the third data structure at an address defined by a coded value of a first term to receive a second address associated with the first term;

directly accessing the third data structure at an address defined by a coded value of a second term to receive a second address associated with the second term;

directly accessing the second data structure at the second address associated with the first term to receive first addresses for the first term;

directly accessing the second data structure at the second address associated with the second term to receive first addresses for the second term; and

directly accessing a first document in the first data structure at an address where a first address for the first term plus an offset given by a length of the first term plus one equals a first address for the second term.