| Distributed database schema -> Monitor Keywords |
|
|
 
Distributed database schemaRelated Patent Categories: Data Processing: Database And File Management Or Data Structures, Database Or File Accessing, Query Processing (i.e., Searching)Distributed database schema description/claimsThe Patent Description & Claims data below is from USPTO Patent Application 20060212432, Distributed database schema. Brief Patent Description - Full Patent Description - Patent Application Claims
BACKGROUND [0001] This invention is related to databases and the manner in which information is represented and searched. [0002] Computers are often used to store and maintain databases. Databases can be of many types. One type of database stores data in tabular form. One type of tabular form is the relational database that stores information in tables related to each other. Relational databases are defined by properties that are present in the table. The table holds data records, which conform to the properties that define the table. However, if one record presents a new piece of information a new table structure needs to be defined to hold that one record. [0003] Other types of databases include hierarchical databases and flat-file structures that are similar to a table or a spreadsheet. Another type of database is the so-called object-oriented database. Object-oriented databases are also called "persistent objects." Persistent objects are defined in classes that have data structure and procedural function and at run time are instantiated to have actual values. The object database can persistently store that object so that it can be retrieved with the same run time state as when it was stored. [0004] The world wide web stores information in resources that can be found through an address such as a uniform resource locator (URL). Initially, most resources on the world wide web were plain text or hypertext mark-up language (HTML) documents. Now there are more dynamic forms of resources available. A resource will use a database to provide information and display it as an HTML document. [0005] A Web crawler is a software program used to search information on the web. A web crawler starts at a page or a set of pages and searches through documents by following links. The links lead from one document to another. The links only contain locational information, i.e., a uniform resource locator (URL) that gives an address or location of the resource, i.e., a server that contains the referenced page. SUMMARY [0006] According to an aspect of the invention, a method of searching for information to construct an information object includes querying a resource having information stored as bindable data elements and returning results from querying the resource to construct the information object. [0007] According to an additional aspect of the invention, a computer-based system includes a search engine that produces a search query and a fragment base that stores data fragments and/or primitives that may be used to satisfy the query. [0008] According to an additional aspect of the invention, a computer based system includes a fragment database and a sense process that reads data referred to a client process and tests the data to determine whether the data can be bound to existing data or produces new data within the fragment database. [0009] According to an additional aspect of the invention, a data structure for a primitive data element resides on a computer readable medium. The data structure includes a type field that specifies the type of primitive element data structure, a binding field that defines how primitive data structure can connect to other primitive data structures to provide fragments and a content field that specifies a value associated with the type, said content field including a referral that specifies a location. [0010] According to an additional aspect of the invention, a fragment data structure residing on a computer readable medium includes at least two primitive elements that have an binding relation to each other. [0011] According to an additional aspect of the invention, a canonical, two primitive fragment data structure residing on a computer readable medium includes a primitive of a first primitive type bound to a primitive of a second type. [0012] According to an additional aspect of the invention, a method of constructing an information object from primitives and/or fragments provided as a result of a query includes providing a set of focused primitives that correspond to a starting set of primitives that are related to the information object and linking primitives in accordance with binding fields of the primitives to produce the information object. [0013] According to an additional aspect of the invention, a method of transforming a fragment of a first form into a second, different fragment of a second form includes applying a transformation function to the first fragment to produce the second, different fragment of a second form. [0014] One or more the following advantages may be provided by aspects of the invention. A search request can allow for expansion of a search space beyond immediate contents of a fragment database. References to external resources may be obtained for the search process. The search process can respond to a direct request for information and the search process can also work in sense mode, in which the search process senses or is given information to read, in order to accumulate and alter information stored a fragment data base. [0015] Fragments and primitives represent information in small pieces that can have both generalized structure and particular data. For example, a fragment can denote an instance of a classification, similar as an object is to a programmed class. However, classification as used with fragments is differentiated from programming class because a programming class is a well-, defined, bounded whole, with pre-defined data structure and functionality. The "classification" on the other hand, is a more primitive starting point, as a label that forms a hierarchical structure. A loose form of search-based inheritance rules can be imposed on classifications, though not with the rigor of conventional programmed class inheritance. By defining fragments to be additive, the fragments do not have to be designed in an object oriented manner of predefined classes. Another distinction from conventional software objects, therefore, is that conventional software objects are quite rigidly defined prior to use, in both data structure and functionality. The addition of attributes to a class definition requires reprogramming. Conventional programmed `objects` therefore have to be preconceived to a high degree of precision. This requirement often runs counter to how people naturally develop a gradual cumulative concept, i.e., information about a thing. In contrast, as information changes and grows incrementally, fragments can be added to or modified within the fragment base to define a larger composite concept of information objects. [0016] A special form of assembly technique is the transformation of one fragment into another fragment based on a transformation function. Fragment transformations can be specified in terms of general fragment structure, i.e. a sequence of primitive-types, without regard to their primitive content. Transformations can be applied to the data in a fragment database to maintain consistency, check and remove identified structures, or change the way information is expressed structurally. Other advantages are disclosed herein. BRIEF DESCRIPTION OF THE DRAWING [0017] FIG. 1 is a block diagram of a network computer system including a server and clients. [0018] FIG. 2 is a block diagram of the system of FIG. 2: operating in a search mode. [0019] FIG. 3 is a block diagram of the system of FIG. 2 operating in a sense mode. [0020] FIG. 4 is a detailed block diagram of the system of FIG. 1. [0021] FIGS. 5A and 5B are flow charts showing details of a search engine used in the system of FIG. 2. Continue reading about Distributed database schema... Full patent description for Distributed database schema Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Distributed database schema patent application. ###  How KEYWORD MONITOR works... a FREE service from FreshPatents1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Distributed database schema or other areas of interest. ### Previous Patent Application: Automatic subscriptions to shared repositories with notifications reflecting accesses by important other users and keywords stored in a personal interest profile Next Patent Application: Distributed product information management Industry Class: Data processing: database and file management or data structures ### FreshPatents.com Support Thank you for viewing the Distributed database schema patent info. IP-related news and info Results in 0.12004 seconds Other interesting Feshpatents.com categories: Daimler Chrysler , DirecTV , Exxonmobil Chemical Company , Goodyear , Intel , Kyocera Wireless , 174 |
 * Protect your Inventions * US Patent Office filing 
PATENT INFO |
|
