1080 results about "Database query" patented technology

The interactive delivery of voice serve messages communicating financial, personal or other news telecasts can be accessed at a subscriber's convenience on an inbound telephone, network enabled or other call. A voice service bureau may generate voice messages for individual subscribers according to their natural language queries. For instance, a subscriber may inquire “What was the closing Dow today” and the system converts the request to digital form, discriminates search terms, interrogates a database and annunciates to the call “The closing Dow was 11,000 today”. Responses to those or other inquiries may be delivered in real time or substantially real time.

The present disclosure provides a natural language query system and method for processing and analyzing multimodally-originated queries, including voice and proximity-based queries. The natural language query system includes a Web-enabled device including a speech input module for receiving a voice-based query in natural language form from a user and a location/proximity module for receiving location/proximity information from a location/proximity device. The query system also includes a speech conversion module for converting the voice-based query in natural language form to text in natural language form and a natural language processing module for converting the text in natural language form to text in searchable form. The query system further includes a semantic engine module for converting the text in searchable form to a formal database query and a database-look-up module for using the formal database query to obtain a result related to the voice-based query in natural language form from a database.

A relational database warehouse system with query optimization capabilities is described that allows for speedy identification of sets of records of interest from amongst tens of millions of records. The records of interest may include complex derived attributes, generated, at least in part, by aggregating data from a plurality of records in base data tables. In various embodiments, the query optimization capabilities allow the database warehouse system to identify conditions under which normal query execution may be replaced by one or more optimized execution methods, including, for example, eliminating unnecessary inner join operations on base data tables specified by a query, re-ordering the execution of group-by operations and left-outer join operations to greatly reduce the size of join tables produced while processing a query, and/or consolidating a set of segmentation queries for execution in one pass over the records of the database.

Query objects are created by a client process. The query objects have one or more sub-query objects and one or more execute methods that are capable of operating on their respective query object to produce one or more query expressions. All of the execute methods are capable of producing the respective query expression that is compatible with a structured query language. A compound query contains one or more boolean expressions of one or more of the query objects. The compound query has one or more compound execute methods which invoke one or more the execute methods of each of the query objects. Each of the execute methods returns their respective query expression and the compound execute method uses one or more common table expressions to combine the query expressions to form a single compound query expression that represents the boolean expression. This single expression can be execute against a database to return a result without executing any of the query expressions against the database individually.

An improved command handler (and database system utilizing the improved command handler) interfaces to a datastore storing item data for a plurality of items and bi-directional modifier data, corresponding to a relation between at least one first item and at least one second item, that represents first text characterizing semantics of a relationship of the at least one first item to the at least one second item, and represents second text characterizing semantics of a relationship of the at least one second item to the at least one first item. The command handler operates, in response to receiving a first-type query command that specifies at least one given item, to access the datastore to identify i) at least one related item that is related to the given item, and identify ii) either the first text or the second text characterizing semantics of the relation between the given item and the at least one related item. The command hander returns i) data corresponding to the at least one related item; and ii) data corresponding to the identified first text and or second text characterizing semantics of the relation between the given item and the at least one related item. Preferably, the data returned in response to the first-type query command identifies the at least one related item. and identifies the first text or second text characterizing semantics of the relation between the given item and the at least one related item. In addition, the command handler preferably supports additional commands that retrieve from the datastore information related to specified objects, object types, and relations.The command handler (and database system) of the present invention may be used in a wide assortment of software applications, including enterprise applications (such as e-business applications, supply chain management applications, customer relationship management applications, decision support applications), the file system in operating systems, web browsers, e-mail applications and personal information management applications. Importantly, the command handler (and database system) provides an efficient mechanism to query the organization of the data elements (and the relationships therebetween) stored and accessed in such software applications, in a manner that efficient and readily adaptable to client-server database systems or other distributed database systems.

A method, apparatus, and article of manufacture for optimizing database queries using automatic summary tables. Query execution plans derived from an automatic summary table can be used to generate results for the query if a comparison of the query requirements with an automatic summary table definition determines that the automatic summary table overlaps the query, and if an optimization process determines that using the summary table will lower the cost of the query. The optimization process involves enumerating a plurality of query execution plans for the query, wherein the query execution plans enumerated include those that access combinations of query and summary tables. Each such query execution plan is assigned a cost representing an estimation of its execution characteristics, and the least costly query execution plan is selected for the query.

A database system with methodology for automated determination and selection of optimal indexes is described. In one embodiment, for example, in a database system, a method of the present invention is described for recommending database indexes to be created for optimizing system performance, the method comprises steps of: capturing a workload representative of database queries employed during system use; creating virtual indexes for optimizing system performance during execution of the database queries captured in the workload; computing cost benefits for different combinations of the virtual indexes; and recommending physical indexes to be created based on virtual indexes that have favorable cost benefits for the captured workload.

The present invention relates to display of visual content on a client device using server-side rasterization of visual content. Visual content is rendered on a server system, transformed into bitmaps compatible with the display attributes of a client device, and transmitted for display on the client device. The invention allows the server to perform, in effect, as a remote browser for displaying Web pages, e-mail, e-mail attachments, electronic document and forms, database queries and results, drawings, presentations, and images at the client device. The approach is “remote” because the server does the rendering and the client provides the interface; “multi-level” because rendered visual content is represented as a multi-level set of raster representations; and constitutes a “browsing system” because the client and server share data about the source visual content element being browsed, and the client performs a specific browsing function assisted by the server.

Optical character recognition (OCR) for images such as a street scene image is generally a difficult problem because of the variety of fonts, styles, colors, sizes, orientations, occlusions and partial occlusions that can be observed in the textual content of such scenes. However, a database query can provide useful information that can assist the OCR process. For instance, a query to a digital mapping database can provide information such as one or more businesses in a vicinity, the street name, and a range of possible addresses. In accordance with an embodiment of the present invention, this mapping information is used as prior information or constraints for an OCR engine that is interpreting the corresponding street scene image, resulting in much greater accuracy of the digital map data provided to the user.

The present invention provides an automated data warehousing and OLAP cube building process. The invention allows a person who is not a database query language expert to build validated data warehouses, and OLAP cubes based on such data warehouses.

Queries are optimized according to a first optimization mode by generating execution plans and selecting the lowest cost plan. Inputs optimized according to the first optimization mode, to database operations with input parameters that are inconsistent with the first optimization mode, are replaced with equivalent inputs optimized according to a second optimization mode, the second optimization mode being consistent with the input parameter. Blocking operations are eliminated from queries using a cost-based approach.

The present invention is a computer-implemented system and method that allows data in different databases to be shared without requiring the data to be remodeled to fit an existing data convention. The invention allows the comparison of two database structures, and facilitates the searching of information from one database to other databases, or from an external set of search criterion against a plurality of databases. The invention allows information to be exchanged from heterogeneous data sources, or database query sources without having to alter the structure of the data sources that are being searched. A number of techniques may be used to do this comparison and facilitate the cross database searching. Tree comparison methods, user defined mapping methods, the use of similarity comparisons to determine similar database structures and data are used to facilitate the cross database searching.

To maintain the integrity and operability of enterprise database systems, queries intended for a particular database engine are intercepted, preferably by a separate processing system, prior to being acted upon by the database engine. The query is evaluated to determine its projected impact on available database system resources. The variables evaluated include user rights, administrator-imposed limits to searches, the amount of presently-available system resources, the cost of query and the like. If the query's potential impact does not surpass a predetermined threshold, it is submitted to the search engine. If the query is too resource-intensive or costly, the query may be (i) optimized by a query-optimization system, (ii) stored until more system resources are available, or (iii) rejected.

Methods, apparatus, and articles of manufacture for processing an abstract query and generating well organized user results are disclosed. Well organized user results preserve the cardinality of one-to-one and one-to-many between data elements retrieved using a database query. Embodiments of the present invention use an abstract database that separates a user from the physical representation of data stored in a data repository by providing a plurality of logical fields based on the substantive information stored in the underlying data repository. During query processing, query results generated from an abstract query are generated and organized according to the one-to-one and one-to-many relationships. Subsequently, query results are presented to users according to the intuitive relationships between data understood by users of an abstract database.

A query engine residing on computer-readable media includes a library of data drivers and an intelligent dataset. Each data driver in the library is operable to execute a predefined database operation. The intelligent dataset is operable in response to a query request to identify from the library necessary data drivers to perform the request. The intelligent dataset is further operable to determine a necessary order of the necessary data drivers to perform the request, to generate a driver chain comprising the necessary data drivers in the necessary order, and to execute in order the data drivers in the driver chain.

The invention provides an interactive large data analysis query processing method. The interactive large data analysis query processing method comprises steps that, 1), a query request generated by a user or a machine is submitted to an SQL query analyzer; 2), the query quest is analyzed by the SQL query analyzer into a logic plan; 3), the logic plan is read by an optimizer and is converted into a physical plan, and interaction between a storage engine and a specific data source is realized; and 4), the physical plan is performed by a performing engine, and meta-data information is provided based on a meta-database query performing framework. For real-time interactive large data set analysis blank, P-byte data is processed under the condition of low delay response through the method according to design, multiple functions of other SQL-on-Hadoop engines are integrated, the query speed is greatly improved, and thereby Hadoop data query and enterprise-level large data analysis can be rapidly and efficiently carried out for enterprise users.