Patents
Literature
40 results about "Relational algebra" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
Relational algebra, first created by Edgar F. Codd while at IBM, is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.
Methods and systems for loading data into a temporal data warehouse
ActiveUS20120150791A1Digital data information retrievalDigital data processing detailsTimestampData warehouse
A system disclosed includes a temporal data warehouse and a platform independent temporal data warehouse load application operable to run on the system. The load application uses timestamp data from incoming data in conjunction with a relational algebra of set operators to identify and sequence net changes between the incoming data and data previously stored within the data warehouse. The load application loads the identified and sequenced net changes into the data warehouse with relatively little intrusion into normal operation of the data warehouse. Optimizations, including but not limited to, distinct partitioning of the workload into parallel streams are selectable via metadata.
Owner:THE BOEING CO
Dynamic, hierarchical data exchange system
InactiveUS7165073B2Overcome limitationsOptimize locationData processing applicationsDigital data information retrievalRelational algebraData operations
A computer system provides the ability to construct and edit a Data Definition File (DDF) containing hierarchically related elements of data, some of which are dynamic in that they must execute in order to produce or retrieve data. A client computer system having knowledge of a DDF appropriate for its uses sends a request to a server, which contains or can retrieve the DDF requested by the client. The request contains parameters used by the server to customize the resulting keyed data file for the client's purposes. Upon receipt of the request, the server copies the DDF into a coupled memory, performs requested parameter substitutions, and executes dynamic elements to produce resulting data elements. The process is repeated recursively for all elements of the hierarchical structure, until no dynamic elements remain, then the resulting keyed data file is returned to the client for its uses. Data elements may be derived from a plurality of sources, and these sources may be combined and manipulated using a plurality of data operations, including relational algebra or structured query language, enabling joins and merges between multiple sources and formats. An Authoring System is provided which assists in the construction and validation of DDFs.
Owner:X AWARE
Structured natural language query and knowledge system
InactiveUS20070294233A1Digital data information retrievalData processing applicationsRelational algebraAdjective phrase
A structured natural language query and knowledge system is provided to allow a user who lacks programming skills to enter a database query or a rule in the form of a structured natural language sentence. The scope of the sentence is preferably defined by an improved object relational query language, an object relational algebra, or both. Command and conditions that appear in natural language form are defined with corresponding formal query texts. A user is prompted to compose a structured natural language sentence using the defined commands and conditions. The user-selected command and its arguments appear as the verb phrase of a structured natural language sentence. The user-selected conditions and their parameters appear as the adjective phrases of the sentence. The sentence is parsed and changed into a translated formal query text for formal database query and rule processing.
Owner:NEC SOLUTION INNOVATORS LTD
Structured natural language query and knowledge system
ActiveUS7263517B2Data processing applicationsDigital data information retrievalRelational algebraHuman language
A structured natural language query and knowledge system is provided to allow a user who lacks programming skills to enter a database query or a rule in the form of a structured natural language sentence. The scope of the sentence is preferably defined by an improved object relational query language, an object relational algebra, or both. Command and conditions that appear in natural language form are defined with corresponding formal query texts. A user is prompted to compose a structured natural language sentence using the defined commands and conditions. The user-selected command and its arguments appear as the verb phrase of a structured natural language sentence. The user-selected conditions and their parameters appear as the adjective phrases of the sentence. The sentence is parsed and changed into a translated formal query text for formal database query and rule processing.
Owner:NEC SOLUTION INNOVATORS LTD +1
System and method for compiling an extensible markup language based query
InactiveUS20050210002A1Digital data information retrievalDigital data processing detailsRelational algebraExtensible markup
An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.
Owner:MICROSOFT TECH LICENSING LLC
Methods and systems for metadata driven data capture for a temporal data warehouse
A system is described that includes a data warehouse and a platform independent data warehouse load application operable to run on the system. The load application includes a sequencing unit configured to utilize timestamp data from incoming data to be stored in the data warehouse and a relational algebra of set operators to identify and sequence net changes between the incoming data and data previously stored within the data warehouse. The load application is configured to non-intrusively load the identified and sequenced net changes into the data warehouse.
Owner:THE BOEING CO
Method for organizing dummy catalog and managing naming space for distributed file systems
ActiveCN101334785AOvercome the disadvantage of not being able to provide on-demand servicesMaintain consistencySpecial data processing applicationsSpatial managementRelational algebra
The invention relates to a DFS (distributed file system) virtual directory organization and name-space management method including the following steps: file metadata of the file system is adopted according to a user inquiry request and a context to compute on-demand and dynamically generate the virtual directory in the relational algebra means so as to provide file serves matching the present context in hierachical form of the virtual file view for the user; the operations of creating, deleting, moving, renaming, opening, closing, reading, writing and cutting to files and operations of creating, deleting and renaming to context directories can be carried out in the virtual directory name-space. The invention has the beneficial effects that the adoption of the computed on-demand and dynamically generated virtual directory in a large-scale mass file storage system overcomes the defect that the traditional hierachical directory structure cannot provide services on demand, and provides the high effective file search and organization form. The adoption of file metadata including file attributes and contexts in the organization process of the virtual directory can actively provide file serves for the user according to the changing of the contexts.
Owner:ZHEJIANG UNIV
System and method for compiling an extensible markup language based query
InactiveUS7386541B2Digital data information retrievalDigital data processing detailsRelational algebraExtensible markup
An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.
Owner:MICROSOFT TECH LICENSING LLC
Methods and systems for loading data into a temporal data warehouse
ActiveUS8688622B2Digital data information retrievalDigital data processing detailsData warehouseTimestamp
Owner:THE BOEING CO
Query processing system of a database using multi-operation processing utilizing a synthetic relational operation in consideration of improvement in a processing capability of a join operation
ActiveUS7680784B2Data processing applicationsDigital data information retrievalRelational algebraSingle task
A query processing system of a database using multi-operation processing includes a task retrieval unit for retrieving relational algebra as tasks from a query tree, a unit for dividing retrieved tasks into groups for each relation of database, a synthetic relational operation unit for creating a synthetic relational operation by collecting tasks having common sub-expression for the grouped tasks into sub-groups and creating a task of a synthetic relational operation for each sub-group, wherein when there is a plurality of tasks of join operation in the grouped tasks, the synthetic relational operation unit further divides the grouped tasks into sub-groups for each common sub-expression of join operation, collects a plurality of tasks of the join operation into a sub-group, and creates a single task of a synthetic join operation by using logical union to concatenate each task of the join operation collected in the sub-group.
Owner:TORU FURUYA
Database capable of integrated query processing and data processing method thereof
InactiveUS20180067987A1Easy to processSemi-structured data mapping/conversionSpecial data processing applicationsGraphicsRelational algebra
The present invention provides a database capable of integrated query processing and a data processing method thereof. The database capable of integrated query processing includes: a storage unit configured to store data including relational data, and graph data; a converter configured to convert a query language for a property graph data model for processing the graph data into a relational algebra that is a statement in an intermediate stage; and a controller configured to control the converter so as to convert the query language for the property graph data model in an input integrated query into a syntactic statement structure, and convert the query language for the property graph data model included in the query into the relational algebra, when the integrated query, in which the query language for the property graph data model and the relational query language are mixed, is input.
Owner:BITNINE
Methods and apparatus for constructing declarative componentized applications
InactiveUS20070174318A1Avoid adaptationSoftware engineeringDigital data processing detailsRelational modelRelational algebra
Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined as a mapping from a current state of the application data model and one or more application inputs to a new state of the application data model and one or more application outputs, described by relational algebra components.
Owner:IBM CORP
Dynamic, hierarchical data exchange system
InactiveUS20070094289A1Digital data processing detailsNatural language data processingRelational algebraData operations
A computer system provides the ability to construct and edit a Data Definition File (DDF) containing hierarchically related elements of data, some of which are dynamic in that they must execute in order to produce or retrieve data. A client computer system having knowledge of a DDF appropriate for its uses sends a request to a server, which contains or can retrieve the DDF requested by the client. The request contains parameters used by the server to customize the resulting keyed data file for the client's purposes. Upon receipt of the request, the server copies the DDF into a coupled memory, performs requested parameter substitutions, and executes dynamic elements to produce resulting data elements. The process is repeated recursively for all elements of the hierarchical structure, until no dynamic elements remain, then the resulting keyed data file is returned to the client for its uses. Data elements may be derived from a plurality of sources, and these sources may be combined and manipulated using a plurality of data operations, including relational algebra or structured query language, enabling joins and merges between multiple sources and formats. An Authoring System is provided which assists in the construction and validation of DDFs.
Owner:VANDERSLUIS KIRSTAN A
XML data-base enquiring method based on relation algebra range arithmetic
InactiveCN101183376AAvoid overheadImprove efficiencySpecial data processing applicationsPath expressionRelational algebra
The invention relates to an XML database query method based on the relational algebra range operation, the method is that: converting the expression of XPath query path to an integral query range, utilizing an effective storage of B-tree index and index XML; converting an easy XPath query path to a range query directly. The invention has the advantages of utilizing an integer range query to realize the XPath query for XML because relational engine is based on the B-tree index, adopting a comparative query searching data corresponding to the primary key, while the integer comparative operation is the fastest in computer, avoiding the overhead of character string matching operation for such realization, and having high efficiency.
Owner:WUHAN DAMENG DATABASE
Algebraic query language (AQL) database management system
ActiveUS20170046391A1Facilitates freeFacilitates rapid developmentSpecial data processing applicationsDatabase modelsRelational algebraRDF query language
A method and system provide an algebraic database management system (ADBMS) that maintains ADBMS type system. The type system includes an ADBMS type database (ATD) and provides a collection of rules that assign a type to constructs. The ATD is a catalog with each record holding typing information. An interpreter dynamically processes, at execution time, a query (that is syntactically modeled on relational algebra). The interpreter: determines inputs of the query; searches the ATD for a data type of each of the inputs, determines compatibility between each of data types of the inputs based on an operator of the query, determines a resultant of the query and a data type of the resultant (based on the operator of the query), and saves the resultant of the query by adding a new record in the catalog.
Owner:CALIFORNIA INST OF TECH
Query execution method and device, electronic equipment and computer readable medium
PendingCN112395303AReduce computing pressureDatabase distribution/replicationSpecial data processing applicationsRelational algebraDistributed database
The embodiment of the invention provides a query execution method and device, electronic equipment and a computer readable medium, and relates to the field of databases. The method comprises the following steps: converting a sub-query in a received SQL request to obtain a relational algebraic expression corresponding to the sub-query; determining a part, which can be pushed downwards to be executed by child nodes in a distributed database, in the relational algebra expression; and converting a part, which can be pushed down to be executed by a child node in a distributed database, in the relational algebraic expression to obtain an SQL instruction used for indicating the child node to execute related operations of the child query. According to the embodiment of the invention, the sub-queries are pushed downwards to the sub-nodes in the distributed database to be executed, and the sub-nodes of the distributed database are effectively combined to execute the sub-queries, so that the overall computing power of the distributed database can be completely utilized, and the computing pressure of an execution server in a distributed database system is effectively relieved.
Owner:ALIBABA GRP HLDG LTD
Methods and Apparatus for Constructing Declarative Componentized Applications
InactiveUS20090254584A1Avoid adaptationSoftware engineeringDigital data processing detailsRelational modelRelational algebra
Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.
Owner:INT BUSINESS MASCH CORP
Enabling multi-view applications based on a relational state machine paradigm
InactiveUS20080126376A1Digital data processing detailsModel driven codeRelational modelRelational algebra
A method and apparatus for constructing a software application with a plurality of screens. Operations performed in the method include representing a data model of the computer application as a relational model, providing a first screen of the computer application representing a current state of the data model, using relational algebra to define control logic of the computer application as a mapping from the current state of the data model and zero or more current application inputs to a new state of the data model and zero or more application outputs, using relational algebra to specify the selection of a second screen as a function of the current state of the data model and zero or more current application inputs, and generating computer executable code displaying the first screen and the second screen on a display.
Owner:IBM CORP
Constructing declarative componentized applications
InactiveUS8250112B2Avoid adaptationSoftware engineeringDigital data processing detailsRelational modelRelational algebra
Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.
Owner:INT BUSINESS MASCH CORP
Distributed query optimization method of equivalent expansion method based on relational algebra
InactiveCN111881160AImprove efficiencyProperties that fit the discrete distributionDigital data information retrievalSpecial data processing applicationsRelational algebraTheoretical computer science
The invention discloses a distributed query optimization method of an equivalent expansion method based on relational algebra, and the method comprises the steps: sending a request, converting a language, constructing a query tree, optimizing fragments, decomposing the query tree, judging whether connection operation exists or not, calculating benefits and judging whether traversal is completed ornot. The method is scientific and reasonable in structure and safe and convenient to use. According to the method, the traditional SQl language is converted into the relational algebra expression byutilizing the consistency of the SQL language and the relational algebra, so that the efficiency of distributed query is indirectly improved, and the query tree is decomposed in the process of constructing the query tree, so the characteristic of data discrete distribution of a distributed system is better met, the data coupling between queries is reduced, the communication overhead is correspondingly reduced, the connection process is optimized through the MapReduce method, the communication overhead between stations in the connection process is greatly reduced, and the communication time iscorrespondingly shortened, so the query efficiency is improved.
Owner:JIANGSU ELECTRIC POWER CO +4
Relational DNA operations
A database implemented by storing information encoded in DNA molecules provides high information density but the information is more difficult to access than in conventional electronic storage media.A relational database is a way of organizing information by using multiple related tables. Relational algebra operations are performed on relational databases to locate and manipulate information. This disclosure provides techniques for implementing relational algebra operations on a relational database that uses DNA molecules to store information. The techniques of this disclosure relate to the structure of DNA molecules used to store the information and to correlations between relational algebra operations and manipulations of DNA molecules.
Owner:MICROSOFT TECH LICENSING LLC
Intelligent optimization of parameterized queries
ActiveUS12455880B2Digital data information retrievalSpecial data processing applicationsRelational algebraTheoretical computer science
A computer implemented method can receive a parameterized query written in a declarative language. The parameterized query comprises a parameter which can be assigned different values. The method can perform a first compilation session of the parameterized query in which the parameter has no assigned value. Performing the first compilation session can generate an intermediate representation of the parameterized query. The intermediate representation describes a relational algebra expression to implement the parameterized query. The method can perform a second compilation session of the parameterized query in which parameter has an assigned value. Performing the second compilation session reuses the intermediate representation of the parameterized query.
Owner:SAP SE
Audit retrieval query method based on data automation information processing technology
PendingCN113468216AAutomate processingFast auditDigital data information retrievalSpecial data processing applicationsInformation processingRelational algebra
The invention discloses an audit retrieval query method based on a data automation information processing technology, and the method comprises a networking audit system which receives a query result of audit retrieval query. The audit retrieval query comprises an auditing method automatic sorting strategy, auditing data processing task expected time, task priority and automatic adjustment and auditing library automatic query performance optimization; the auditing method carries out automatic sorting according to the importance degree. The audit retrieval query is used for estimating audit data processing task expected time according to an audit mirror image database, the audit data processing task expected time and task priorities are automatically adjusted and distributed, audit data are queried and processed according to integration of multiple tables, and the auditing method is used for querying through relational algebra. The invention has the beneficial effects that automatic processing of audit retrieval query data can be effectively realized, the audit speed is relatively high, and the efficiency is relatively high.
Owner:POWER DISPATCHING CONTROL CENT OF GUANGDONG POWER GRID CO LTD +2
Method for organizing dummy catalog and managing naming space for distributed file systems
ActiveCN101334785BOvercome the disadvantage of not being able to provide on-demand servicesMaintain consistencySpecial data processing applicationsSpatial managementRelational algebra
Owner:ZHEJIANG UNIV
Secret relational algebra operation system, secret computing device, secret relational algebra operation method and program
ActiveCN116686029BComputer security arrangementsCoding/ciphering apparatusRelational algebraTheoretical computer science
The secret computation unit (1) included in the secret relational algebra operation system secretly performs a combination of first and second relational algebra operations on the input table of the operands. The input unit (11) contains the encrypted table of the operands. The first relational algebra operation unit (12) secretly performs the first relational algebra operation on the input table. The valid row extraction unit (13) generates an intermediate table from which valid rows have been extracted from the results of the first relational algebra operation. The second relational algebra operation unit (14) secretly performs the second relational algebra operation on the intermediate table. The output unit (15) outputs the result of the second relational algebra operation.
Owner:NIPPON TELEGRAPH & TELEPHONE CORP
Common Cell Algorithm for LRS Segment Join Operations
InactiveUS20160203205A1Provide supportDigital data processing detailsMulti-dimensional databasesData setAlgorithm
In the linear location referencing system (LRS) domain, one of the key challenges is joining LRS segments from different datasets by their common spatial (spatiotemporal) existence. The invented LRS join algorithm is based on relational algebra that provides high performance along with algorithmic clarity. It addresses what the prior art has failed to address or address performantly.The invented algorithm first generates a cell mesh for each route, which is then used to decompose the segments participating in the join operations. The resulting segments are determined based on the cell population configuration. Finally, the results are coalesced to keep LRS datasets compact and normalized.
Owner:GUO BO
Tensioning heterogeneous data processing method and device, equipment and storage medium
PendingCN122019588AResource allocationSpecial data processing applicationsExecution planTable (database)
The invention provides a tensorized heterogeneous data processing method and device, equipment and a storage medium. The method comprises the steps of obtaining a high-level query statement corresponding to data in a to-be-processed database table; the advanced query statement is analyzed, a logic execution plan corresponding to the advanced query statement is obtained, and the logic execution plan comprises a relational algebraic operator; mapping the relational algebraic operator into a tensor execution operator based on a query planner; the tensor execution operator is dynamically scheduled to a CPU or a DPU end for execution through a tensor execution engine, in the method, a relational algebraic operator is mapped into the tensor execution operator based on a query planner, the tensor execution operator is dynamically scheduled to the CPU or the DPU end for execution through scheduling of the tensor execution engine, high bandwidth and parallelism in the PIM can be fully utilized, and the performance of the PIM is improved. And meanwhile, the global control and complex calculation capability of the CPU is reserved, and the data processing efficiency is improved.
Owner:SHANGHAI JIAOTONG UNIV
Algebraic query language (AQL) database management system
ActiveUS10915531B2Facilitates free and rapid developmentSpecial data processing applicationsDatabase modelsData classRelational algebra
A method and system provide an algebraic database management system (ADBMS) that maintains ADBMS type system. The type system includes an ADBMS type database (ATD) and provides a collection of rules that assign a type to constructs. The ATD is a catalog with each record holding typing information. An interpreter dynamically processes, at execution time, a query (that is syntactically modeled on relational algebra). The interpreter: determines inputs of the query; searches the ATD for a data type of each of the inputs, determines compatibility between each of data types of the inputs based on an operator of the query, determines a resultant of the query and a data type of the resultant (based on the operator of the query), and saves the resultant of the query by adding a new record in the catalog.
Owner:CALIFORNIA INST OF TECH
Traditional Chinese medicinal material quality tracing modeling method with gradable data granularity
PendingCN110097375AMeet data granularity requirementsSolve the problem of single output of traceability data granularityNatural language data processingCommercePushdown automatonRelational algebra
The invention discloses a traditional Chinese medicinal material quality tracing modeling method with gradable data granularity, which comprises the following steps of firstly, designing a data storage structure and a data acquisition algorithm based on a relational algebra theory on the basis of designing 12 mode primitives for describing a tracing unit conversion process on a traditional Chinesemedicinal material supply chain; and then based on a syntactic pattern recognition theory, on the basis of constructing a formalized description grammar of the traditional Chinese medicinal materialproduct traceability data, constructing a recursion-based sentence generation algorithm and forming a granularity classification specification method based on an improved push-down automaton, therebyestablishing a variable granularity model of the traditional Chinese medicinal material quality traceability data. The method can meet the data granularity requirements of the government supervisors,social public and production enterprises at the same time, and effectively solves the problem that a traditional Chinese medicinal material quality tracing system is single in tracing data granularityoutput.
Owner:ANHUI UNIVERSITY OF TRADITIONAL CHINESE MEDICINE
Database system supporting kernel-level multiple protocols and data communication method thereof
The invention relates to the technical field of databases, and particularly discloses a kernel-level multi-protocol supporting database system and a data communication method. According to the system, the support capabilities of multiple database protocols such as MySQL and PostgreSQL are originally integrated in a database kernel to form a unified database instance. The basic principle is that client connections are directly distributed through an instantaneous routing mechanism of a network port; syntax and deep semantics (such as transactions, types and error codes) of different protocols are converted into a unified relational algebraic expression in a coordinated mode through a built-in unified semantic core layer; and optimizing and executing the unified semantic expression through a protocol-independent core processing layer, and realizing cross-protocol execution plan and result reuse by using a global DAG cache based on semantic hash. According to the method, high-performance and high-compatibility multi-protocol data service is realized, and the problems of performance overhead and incomplete semantic conversion caused by an external proxy architecture are thoroughly eliminated.
Owner:HANGZHOU YIJING DIGITAL TECH CO LTD