×

Method for storing text annotations with associated type information in a structured data store

  • US 7,558,786 B2
  • Filed: 12/21/2005
  • Issued: 07/07/2009
  • Est. Priority Date: 12/24/2004
  • Status: Expired due to Fees
First Claim
Patent Images

1. A database search method in a database system, said database system comprising a computer including a CPU, a memory, and a storage device, said database being stored in said storage device, said database search method making said computer execute the steps of:

  • storing parts tables of items appended by timestamps in a database, including parts table identifiers, and storing items in an indexing table in which the update time and parts table identifier are stored, said parts tables being indexed by indexing data, said database and said parts tables being updatable by appending only,categorizing said items by timestamp and parts table identifier into said parts tables, and indexing said parts tables by indexing data such that time differential between given items is correlated to time differential between indexing data corresponding to said given items,appending said database with items from a second database when a predetermined number of new items becomes available in said second database,storing an indexing table for said indexing data, listing a newest timestamp of said parts tables together with said indexing data,searching for a target item from said indexing table among said items from said parts tables,repairing said indexing table with respect to time evolution by a maintenance module, said maintenance module executing further steps of;

    updating, in response to an event, said indexing table by appending said indexing table with items from said parts tables, and said updating occurs when a new one of said parts tables is issued,monitoring correlation between said parts tables and said indexing table by comparing a timestamp of an item with a newest timestamp in said parts tables with a timestamp of an entry in said indexing table, said entry in said indexing table corresponding to said item with said newest timestamp in said parts tables, andexamining said correlation of said indexing table using said newest timestamp and said indexing data as examination keys,repairing said indexing table by predicting an insert sequence of entries in said indexing table if a value of said newest timestamp of said parts table identifier is less than a value of said timestamp corresponding to the parts table identifier of said entry in said indexing table for said item having said newest timestamp,returning a positive value, indicating said indexing table is in regular order if said value of said newest timestamp of said parts table identifier is greater than a value of said timestamp corresponding to the parts table identifier of said entry in said indexing table for said item having said newest timestamp,indicating that said indexing table is in regular order if said value of said newest timestamp of said parts table identifier is between two values of timestamps corresponding to the parts table identifier of said indexing table,repairing said indexing table by predicting the insert sequence of entries in the indexing table and inserting the insert sequence corresponding to the parts table identifier, if said value of said newest timestamp of said parts table identifier is between two values of timestamps of said indexing table, with the two values of timestamps of said indexing table corresponding to different parts table identifiers,executing a binary search of said database with referring said indexing table,determining whether or not an appending of records of said indexing table is required depending on search keys, anddepending on said determination step, if said appending is required, calling a repairing function so as to append said update records while executing said binary search.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×