937 results about "Database querying" patented technology

An apparatus and method defines a markup language for accessing data in a database. The markup language is preferably defined in extensible markup language (XML) by creating suitable document type definitions (DTDs), which define the grammar for accessing data in the database using the markup language. A bridge interprets the data request from the client in markup language format, a suitable database query for the database is formulated, and the data is then placed within a document for delivery in markup language format to the user. As new data types are added to the database, corresponding document type definitions (DTDs) may be dynamically generated, allowing a user to access new kinds of data in a database with a software tool that has a user-friendly graphical user interface without having to manually update the software tool for each new data type that is added to the database.

Fraud detection is facilitated by developing account cluster membership rules and converting them to database queries via an examination of clusters of linked accounts abstracted from the customer database. The cluster membership rules are based upon certain observed data patterns associated with potentially fraudulent activity. In one embodiment, account clusters are grouped around behavior patterns exhibited by imposters. The system then identifies those clusters exhibiting a high probability of fraud and builds cluster membership rules for identifying subsequent accounts that match those rules. The rules are designed to define the parameters of the identified clusters. When the rules are deployed in a transaction blocking system, when a rule pertaining to an identified fraudulent cluster is triggered, the transaction blocking system blocks the transaction with respect to new users who enter the website.

The invention provides a method for predicting which network objects are likely to be requested by a web user from a web server, such as that used in conjunction with an internetworking environment. A request made by a web user for a web object is parsed and dynamic values contained therein normalized. A prediction is made based on the normalized request, statistical measures, and other factors about what other web objects the web user is likely to request. The predictive information is then made available to the web server and the predicted net objects are pre-downloaded to the Web client. A pre-download statistics server may be used to record and provide statistics to assist in the prediction process. Examples described herein relate to web pages, but the invention is broadly applicable to many different types of requests for information (such as, for example, database queries and other libraries of information.)

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.

A method and system for automated intelligent electronic advertising. The method and system parse electronic information messages (e.g., e-mail messages, instant messages, etc.) for keywords and make search engine queries or database queries for electronic links based on the identified keywords. The electronic links returned from search engine queries or database queries are added to the electronic information messages creating a modified electronic information message. This allows additional electronic information to be accessed from the modified electronic information message based on information content of the original electronic information message.

A method for mapping a data source of an unknown configuration to that of a known configuration, comprising the steps of submitting a request for metadata to the data source of the unknown configuration; generating a relational schema from the known configuration based on the metadata received from the data source of the unknown configuration; and returning the metadata of the generated relational schema which maps the data source of the unknown configuration to the known configuration. In a preferred embodiment data source of the unknown configuration is a multidimensional database and the known configuration is a star or snowflake relational schema.

A system and method that automatically adds contacts to a user's instant messaging buddy list is provided. The contacts are added based upon existing database (i.e., directory) information as well as meeting information extracted from the user's calendar. The list of calendar contacts is included with the user's calendar. This list is used to automatically populate the user's buddy list. In one embodiment, a buddy list “group” is initialized for calendar entries. Contacts are also added to a user's buddy list through database queries. The group of contacts resulting from the query are then added to the user's buddy list. Contacts added to the user's buddy list through the user's calendar or through database queries can be made permanent or temporary. Temporary contacts are automatically removed after a specified period of time.

A data query and reporting method and system are provided. The method and system allow non-technical computer users to build and execute complex database queries. The method and system accommodate the need for a simple, easy-to-understand interactive and iterative means for generating and validating database queries. The method and system reduce the complexity and costs associated with retrieving useful information for organizations of all sizes, especially smaller businesses. The method and system support a robust security model, enabling organizations to protect sensitive data while providing broad data access.

A system and method for dividing a received database query into a number of parallel subqueries and then submitting the parallel subqueries to a database management system in place of the received query. During database configuration, an embodiment of the invention ensures that a database table includes a partitioning field populated with random numbers. Each time a record is added to the table, an embodiment fills the partitioning field with a new random number. When a query on the database table is received, an embodiment determines a number of parallel subqueries to submit in place of the received query. Each of the parallel subqueries is constructed based on the initially received query combined with an additional constraint on the partitioning field such that the set of parallel subqueries together span the entire range of the random numbers in the partitioning field, and yet each of the parallel subqueries describes a discrete non-overlapping range of the partitioning field. The constraint on the partitioning field (i.e., the size of each range of random numbers) may be determined by trial queries on the database. Finally, an embodiment submits the parallel subqueries to the database management system in place of the received query.

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 method for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated using a set of random decision trees (RDTs). A query workload and / or database statistics are dynamically updated. A new set of training points collected off-line is used to modify the first classifier into a second classifier. A database query is received at a runtime subsequent to the off line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. The query execution plan is determined by identifying an optimal average of posterior probabilities obtained across a set of RDTs and mapping the selectivities to a plan. The determined query execution plan is included in an augmented set of training points that includes the initial set and the new set.

Disclosed herein is a method and system for integrating an enterprise's structured and unstructured data to provide users and enterprise applications with efficient and intelligent access to that data. Queries can be directed toward both an enterprise's structured and unstructured data using standardized database query formats such as SQL commands. A coprocessor can be used to hardware-accelerate data processing tasks (such as full-text searching) on unstructured data as necessary to handle a query. Furthermore, traditional relational database techniques can be used to access structured data stored by a relational database to determine which portions of the enterprise's unstructured data should be delivered to the coprocessor for hardware-accelerated data processing.

A system providing methods enabling data in Extensible Markup Language ("XML") format to be extracted, transformed and stored in a database, file system or main memory is described. The extraction and transformation process is generalized and can be used on various types of XML data, enabling XML data to be stored and queried using standard database query methodologies. The system includes parse-time functionality to transform XML documents into a structure having an interface that enables efficient access to the underlying data. The system also includes query execution-time functionality providing greater efficiency by bringing only the relevant portions of transformed XML data into memory in response to a query. The system parses and translates queries into a structure that can be executed without the need to write custom application-specific navigation code to search XML data. The system also enables original XML documents (or portions thereof) to be recomposed when required.

A three dimensional user interface allows browsing of a database displayed as a three dimensional information space. The data is organized along three axes. A current plane or layer of data is summarized on an information landscape, with different planes being selectable using a tower that is located at the intersection of the three axes. A control wall with incorporated tools is used to formulate database queries. A preview wall previews selected data. The preview wall also provides transition between previewing the searches in the 3D space and actual viewing of the programming in full screen 2D display. Application to TV programming data is shown.

This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. The present invention provides a method for generating executable machine code for query execution plans, that is adaptive to dynamic runtime conditions, that is compiled just in time for execution and most importantly, that avoids the bounds checking, pointer indirection, materialization and other similar kinds of overhead that are typical in interpretive runtime execution engines.

A computer system has an interface to one or more databases, one or more base query objects, query objects, compound queries, annotator objects and graphical user interfaces (GUI's). The base query objects have one or more base query object methods, base variables, and base objects, the base query object methods being specific to the specific database and capable of querying the specific database. Each of the query objects derived from one of the base objects, and has a query type, one or more query object methods, query object variables, and query object objects. Each query object method is capable of querying a specific database to obtain a type result having the respective type. The compound query has one or more compound query methods, compound query variables, and compound query object objects. The operator objects, are derived from one of the base query objects that are used with the specific database. (GUI) has one or more query elements with one or more operators. The query elements, operators, and conditions are user selectable. Each query element, operates on the query object with the same type as the query element to create an instance of the query object with the query element. The compound query object instance uses the instances and the operator object instances to create an a query expression for the specific database. Therefore the input in the GUI is translated into a single compound query object.

A system and method are provided for detecting fraud and / or misuse in a computer environment through tracking users activities at the application layer for known users. Application layer data and other data are normalized and records are created. The normalized data is correlated to user identities to produce correlated information that is analyzed against modeling information. The modeling information is generated using rules, algorithms, and / or database queries to define fraud scenarios and misuse scenarios. Reports and / or alerts may be generated if fraud and / or misuse are detected.

A method and system for dynamically generating database queries is disclosed. The method and system include storing web interface data, including query attributes for a database, in one more tables. The attributes are then retrieved from the tables and displayed in a graphical user interface web page for user selection. Based on the attributes selected by the user, a SQL query is dynamically generated. The method and system further include displaying results of the SQL query to the user in graphical format, thereby enabling dynamic generation of custom queries.

A system for calling designated addressable notify devices in response to a query to a local telephone company's ALI database system. An advertisement of the 9-1-1-call notification service directs the new subscriber to contact their local telephone provider to register with the new service. The local telephone provider supplies the new system with the registered subscriber's telephone number (ANI) and password. The new subscriber them calls the new service provider directly to register their addressable communication devices to be notified pending a positive reaction to an ALI database system query and the service providers subscriber database. When a registration call is received from a new subscriber, the software proceeds with a voice answerback menu to register numbers to be notified. The notify numbers are stored in a list in a database memory maintained by the notify service. If a call is received from a current subscriber, the software proceeds with a voice answerback menu to update the previously registered numbers to be notified. Subsequently, if a 9-1-1 call is placed from a station that has previously been registered with the service which initiates an ALI database query, the software automatically places a call to each addressable notify device on the subscriber's notify list. If an answer is confirmed, the software transmits a notify message over the telephone or wireless line. The message at least identifies the subscriber's telephone number, and the time and date of the call. If an answer is not confirmed, or the line is busy, the software turns on a "call later" tag associated with the notify number corresponding to the unconfirmed or uncompleted call. Periodically, the software services any tagged, unconfirmed notify calls.

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.

A database query optimizer constructs a graph comprising nodes, relations, and expressions. The query optimizer then constructs execution plans for sub-parts of the graph. The combination of execution plans make up the overall execution plan for the query. The execution plan information is appended to the graph itself, allowing changing an execution plan in one portion of the graph without necessarily changing execution plans in other portions of the graph. By representing a query using the graph of the preferred embodiments that includes execution plan information, the query optimizer is able to evaluate the execution plans of different options quickly and efficiently, thereby enhancing the performance of the query optimizer.

A system and methods for parallel processing of queries to one or more databases are described herein. One or more databases may be distributed among a subset of slave nodes of a global-results processing matrix. A query to the database may be generated using a query-based high-level programming language. The query-based source code then may be converted to intermediary source code in a common programming language and then compiled into a dynamic link library (DLL) or other type of executable. The DLL is then distributed among the slave nodes of the processing matrix, whereupon the slave nodes execute related portions of the DLL substantially in parallel to generate initial query results. The initial query results may then be provided to master node of the global-results processing matrix for additional processing, whereby the master node is adapted to execute one or more associated portions of the DLL on the initial query results.

A system and method for using heterogeneous data from multiple healthcare information sources in a medical decision support system is disclosed. Each healthcare information system stores medical data using a different local schema. The medical decision support system provides responses to user queries. A query is received from a user that is generated in a standardized global schema. The query includes information from medical ontologies. Database queries are generated from the user queries that use the medical ontologies to generate constraints in the queries. The medical ontologies are also used to infer database queries. The generated query is translated into multiple queries for the multiple healthcare systems wherein each query is in the local schema of the healthcare information system that is being queried. Each database query is transmitted to one of the healthcare information systems based on the local schema of the particular query. Data is collected from each of the queried healthcare information system and analyzed. A query response is formulated for the user

A new approach to maintaining concurrency in a network element management database. A background process constantly monitors the channels which carry network element configuration commands, and automatically parses any messages which carry information about the status of network elements. The information derived from parsing these messages is then used for a dynamic update of the database of network element attributes. This means that the database is completely current on the very latest status changes, and operators do not have to cross-check log files to see if their data is current. Instead, a simple database query retrieves fully current information.

Disclosed is a multi-dimensional selectivity estimation method using compressed histogram information which the database query optimizer in a database management system uses to find the most efficient execution plan among all possible plans. The method includes the several steps to generate a large number of small-sized multi-dimensional histogram buckets, sampling DCT coefficients which have high values with high probability, compressing information from the multi-dimensional histogram buckets using a multi-dimensional discrete cosine transform(DCT) and storing compressed information, and estimating the query selectivity by using compressed and stored histogram information as the statistics.