Value-instance-connectivity computer-implemented database field of the invention
a technology of value-in-type connection and computer-implemented databases, applied in multi-dimensional databases, data acquisition and logging, instruments, etc., can solve the problems of similar costs, more complicated search for the second part (composite/power2/prime/unit), and more complicated counts for either column involved, so as to simplify database organization and maintenance, reduce database storage requirements, and efficient query
Inactive Publication Date: 2008-09-25
TARIN STEPHEN A
View PDF3 Cites 5 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
This approach reduces storage requirements, enhances data manipulation efficiency, and supports fast query processing, making high-speed main-memory databases practical for various applications.
Problems solved by technology
Searching for values matching the first part of the combined field (Even / Odd) is generally unchanged, but searching for the second part (Composite / Power2 / Prime / Unit) is more complicated.
Counts are also more complicated for either column involved.
More than two columns may be combined, with similar costs.
Although capable of delivering low-coefficient constant-time performance when implemented with an efficient hash function on an appropriate size hash table, the search for high-performance hash parameters can be complex, difficult and data dependent (e.g., depending on both the number and distribution of values).
Still more importantly, hashing has major drawbacks -especially as implemented by state of the art DBMS's.
Hash functions typically fail to return ordered results rendering them unsuitable for range queries, user requests for ordered output, such as SQL “sort-by” and “group-by” queries, and other queries whose efficient implementation is dependent on sortedness, such as joins.
In prior art database systems, joins tend to be extremely costly in storage space and / or processing time, requiring either pre-indexed data to maintain sortedness or a time intensive search involving multiple passes over the entirety of each attribute that is being joined.
Consequently, if there are many more values without than with instances (referred to hereafter as the “sparse” case), there are many more repeated than different values in the displacement structure, leading to redundancy in the displacement table.
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0053]FIG. 1 illustrates the basic hardware setup of an embodiment of the present invention. Program store 4 is a storage device, such as a hard disk, containing the software that performs the functions of the database system of the present invention. This software includes, for example, the routines for generating the data structures of the underlying database and for reformatting legacy databases, such as those in record-oriented files, into those data structures. In addition, the software includes the routines for manipulating and accessing the database, such as query, delete, add, modify and join routines. Data files are stored in storage device 2 and contain the data associated with one or more databases. Data files may be formatted as binary images of the data structures herein or as record-oriented files. Program store 4 and storage device 2 may be different parts of a single storage device. The software in program store 4 is executed by processor 5, having random access memo...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
A computer-implemented database and method providing an efficient, ordered reduced space representation of multi-dimensional data. The data values for each attribute are stored in a manner that provides an advantage in, for example space usage and / or speed of access, such as in condensed form and / or sort order. Instances of each data value for an attribute are identified by instance elements, each of which is associated with one data value. Connectivity information is provided for each instance element that uniquely associates each instance element with a specific instance of a data value for another attribute.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS[0001]This application is a continuation of application Ser. No. 10 / 629,812 filed on Jul. 28, 2003, which is a division of application Ser. No. 09 / 412,158 filed on Oct. 15, 1999, now issued as U.S. Pat. No. 6,606,638, which is a continuation of application Ser. No. 09 / 112,078 filed on Jul. 8, 1998, now issued as U.S. Pat. No. 6,009,432.FIELD OF INVENTION[0002]The present invention relates generally to computer-implemented databases and, in particular, to an efficient, ordered, reduced-space representation of multi-dimensional data.BACKGROUND OF THE INVENTION[0003]State of the art database management systems (DBMS's), like the underlying data files out of which and on top of which they historically grew, continue to store and manipulate data in a manner that closely mirrors the users' view of the data. Users typically think of data as a sequence of records (or “tuples”), each logically composed of a fixed number of “fields” (or “attributes”) tha...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & AuthorityApplications(United States)
IPC IPC(8): G06F17/30G06FG06F12/00G06F17/00
CPCY10S707/99943Y10S707/99932Y10S707/99933G06F17/30592Y10S707/99944G06F17/30312Y10S707/99934G06F16/22G06F16/283G06F17/40
InventorTARIN, STEPHEN A.
OwnerTARIN STEPHEN A