Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Database and method for evaluating data therefrom

a database and data technology, applied in the field of computer-implemented querying mechanisms for obtaining and/or evaluating data from databases, can solve the problems of high cost of operation, inability to efficiently allow large amounts of contiguous data to be accessed, and/or bus usage, so as to achieve efficient monitoring of different phenomena, enhance damping, and maintain the effect of safety

Inactive Publication Date: 2017-11-23
FAKEIH ADNAN
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This approach significantly reduces I / O bus usage and network bandwidth required for data analysis, enabling rapid and efficient evaluation of large volumes of data by allowing the identification of minimum or maximum values through retrieving only a single data value, thus lowering overall computing costs.

Problems solved by technology

While these databases are well-suited to performing traditional transaction-oriented operations, they do not provide an efficient means for allowing large amounts of contiguous data to be accessed and / or evaluated.
Thus, the operation is costly in terms of the I / O bus usage and / or network bandwidth utilization in retrieving the dataset, and in terms of the computation required to evaluate the dataset.
These costs will increase as the number of values in the requested data string increases.
In particular, comparative experimentation may be extremely costly, due to the cost of retrieving and evaluating a number of individual data sequences.

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 more

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0065]An example of the technique of coverage mapping will be illustrated using the sample dataset shown in Table 1. The sample dataset of Table 1 has 10 records, which are each assigned to a location. The location numbers define a “direction” of the database, i.e., the location numbers increase in a forward direction of the database and decrease in a backward direction of the database. In general, data records are entered into the database in time order, that is, the first location contains the oldest record and the highest location number contains the most recent record.

TABLE 1location12345678910record516410212213677

[0066]To generate the intermediate description, the following operations must be performed in turn for each data record rc in the sequence, moving from the oldest record to the most recent record.

Operation 1

[0067]Starting from the current location, check to find the location of the earliest value which is covered. That is, move backwards in the database, in the directi...

example 2

[0074]Table 4 presents a detailed example showing how the database is built up in a series of stages, as each new record is entered in the database. Thus, at stage 1, the database has 1 record at location 1, while at stage n, the database has n records, the nth record being at location n. As each new record is inserted into the database, coverage and label values are updated, as explained in the row labeled “algorithm step”.

TABLE 4Stage 1LocationRecordCoverageLabel119119Algorithm step (stage 1): Upon searching for record values smaller and older than the new record, we reach the start of the database. Thus, coverage value of the new record is 1 and the new label is 19Stage 2LocationRecordCoverageLabel119152515Algorithm step (stage 2): Upon searching for record values smaller and older than the new record, we reach the start. Thus, coverage value of the new record is 1 and the new labels are 5 starting from location 1Stage 3LocationRecordCoverageLabel1191325133313Algorithm step (stag...

example 3

[0078]Tables 5-8 show how an intermediate description can be generated for longer data series. In these Tables, coverage and labels have been updated relative to the most recently-entered record value. The Tables present snapshots of the database for stages 5, 10, 15, and 20 (i.e., after 5, 10, 15, and 20 records have been entered, respectively). Sample queries are presented for data strings of interest extending backwards from the most recent record at each particular stage.

TABLE 5(Stage 5)locationrecordcoveragelabel1191325133313417455545Sample query Get minimum of last 2 entries at stage 5. Output from sample query Minimum of last two entries = 5 (i.e., the label of location 4)

TABLE 6(Stage 10)locationrecordcoveragelabel11910251033104174055406136071970813709179010010Sample query Get minimum of last 5 entries at stage 10 Output from sample query Minimum of last 5 entries = 0 (i.e., the label of location 6)

TABLE 7(Stage 15)locationrecordcoveragelabel119102510331041740554061360719708...

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

No PUM Login to View More

Abstract

A computer system for use in determining the minimum and / or maximum value of a specified subsequence of a sequence of values. The computer system comprises a database that is configured to store a sequence of values, to identify a minimum and / or maximum value of the sequence of values, and to define at least a first subsequence of values and a second subsequence of values immediately following the first subsequence of values, wherein the boundary between the first and second subsequences is located at the position of either the minimum or maximum value of the sequence.

Description

BACKGROUNDTechnical Field[0001]The present disclosure relates to computer-implemented querying mechanisms for obtaining and / or evaluating data from a database, in particular to querying mechanisms for obtaining minimum or maximum values from a sequence of numerical values stored in the database.Description of the Related Art[0002]A database is a structure for storing and relating data within e.g., a computer system. Different database architectures exist depending on the intended usage. The primary use for general purpose databases is to manage and facilitate data entry and retrieval in relation to the relevant application. A recent trend has been the emergence of specialized database architectures optimized to work with specific application domains.[0003]Complex event processing (CEP) is a technology for low-latency filtering, correlating, aggregating and / or computing on real-world event data, e.g., financial data. Such data is usually generated at high frequencies and so needs to ...

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
no application Login to View More
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F17/30
CPCG06F17/30548G06F17/30536G06F17/30289G06F17/30312G06F17/30G06F16/2474G06F16/00G06F16/21G06F16/22G06F16/2462
Inventor FAKEIH, ADNAN
Owner FAKEIH ADNAN
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com