250 results about "Recordset" patented technology

A real-time system incorporating speech recognition and linguistic processing for recognizing a spoken query by a user and distributed between client and server, is disclosed. The system accepts user's queries in the form of speech at the client where minimal processing extracts a sufficient number of acoustic speech vectors representing the utterance. These vectors are sent via a communications channel to the server where additional acoustic vectors are derived. Using Hidden Markov Models (HMMs), and appropriate grammars and dictionaries conditioned by the selections made by the user, the speech representing the user's query is fully decoded into text (or some other suitable form) at the server. This text corresponding to the user's query is then simultaneously sent to a natural language engine and a database processor where optimized SQL statements are constructed for a full-text search from a database for a recordset of several stored questions that best matches the user's query. Further processing in the natural language engine narrows the search to a single stored question. The answer corresponding to this single stored question is next retrieved from the file path and sent to the client in compressed form. At the client, the answer to the user's query is articulated to the user using a text-to-speech engine in his or her native natural language. The system requires no training and can operate in several natural languages.

Systems and methods for automatically importing, refreshing and maintaining corrections to a list of contacts through addition, deletion, and change detection, and for merging disparate sources of data into a single unified list of contacts, according to configurable rule sets for resolving conflicts between the merged sources' values for any given field. Record sets are compared and automatically matched without requiring a unique contact identifier or key field; new records and deleted records are detected; conflicting information for any given field in a record is resolved; and updates to a local database are applied such that any override or augmentation of the data in the local database can persist for a given record. Multiple overlapping contact data sources are merged so as to identify common records, and the data combined so as to preserve as much information as possible, while concurrently handling conflicting data as it is encountered.

A method is disclosed for configuring a data storage device. The data storage device receives a configuration code, and in response to the configuration code selects a configuration data record set from a plurality of configuration data record sets. The data storage device is configured in response to the selected configuration data record set. For example, the data storage device may be configured into a manufacturing test procedure mode, and then into a customer specific operating mode. In another embodiment, a hardware configuration of the data storage device is identified, and the configuration code selected based on the identified hardware configuration.

An access server computing system scrapes a set of records maintained by a target computing system in a database which is only made accessible over the Internet with a limited protocol query and an access challenge. The access server accesses the target computing system through an Internet browser interface based on emulating a user query made through the limited protocol, including by automatically passing locator identifier fields to retrieve a corresponding set of record which are stored in the first database.

An electronic data system comprises memory storage having stored data, file system software, and a transaction file. The transaction file is maintained by the file system software, and includes a plurality of transaction records corresponding to transactions that have been or are to be executed on one or more files and/or the or more directories of the file system. The file system software operates to organize and maintain the stored data in the files and directories and also to coalesce multiple transaction records meeting one or more criteria into fewer coalesced transaction records. The physical memory space required by the transaction file is reduced by the transaction record coalescing. The coalesced transaction records may be constructed so that they represent a logical result of applying each transaction record of a transaction record set in chronological order. Once the coalesced transaction records have been committed in the file system, the physical memory used by the original transaction records in the set may be reclaimed for further use (e.g., to store further transaction records) or may be otherwise removed from further use (e.g., when the physical memory is located in a block of memory in a flash-like memory device that has reached its maximum number of write and/or erase cycles).

A system for a distributed database implementing a dynamic mastership strategy. The system includes a multiple data centers, each having a storage unit to store a set of records. Each data center stores its own replica of the set of records and each record includes a field that indicates which data center is assigned to be the master for that record. Since each of the data centers can he geographically distributed, one record may be more efficiently edited with the master being one geographic region while another record, possibly belonging to a different user, may be more efficiently edited with the master being located in another geographic region.

A system for backing up a set of records. The system comprises a database in which to store the set of records and a data management module configured for backing up the set of records in a plurality of record groups in a first continuous data batch using a single data stream in the database and simultaneously logging a plurality of transactions related to one or more of the set of records in the first continuous data batch. Each record group has one or more records of said set of records. The system is designed for recovering said set of records from the first continuous data batch.

A method comprises the steps of obtaining a property setting, from a predefined set of properties; obtaining information comprising process identification, localization identification, and current user identification; using the information with a localization ID to enable access to a data definition table including current process information and current system information; constructing a user presentation; creating a record set object using a business object; creating a painter object with the business object; initializing properties of the painter object and providing the painter set object with the record set object. The method further comprises the steps of insuring the validity of the record set object using the painter object by insuring that the record set object contains a pointer record set component; determining if a menu is required using a process type code obtained in an initialization process; and retrieving a menu definition information from a menu object tables for a target language using the localization ID.

A method and system for generating a decision-tree classifier from a training set of records, independent of the system memory size. The method includes the steps of: generating an attribute list for each attribute of the records, sorting the attribute lists for numeric attributes, and generating a decision tree by repeatedly partitioning the records using the attribute lists. For each node, split points are evaluated to determine the best split test for partitioning the records at the node. Preferably, a gini index and class histograms are used in determining the best splits. The gini index indicates how well a split point separates the records while the class histograms reflect the class distribution of the records at the node. Also, a hash table is built as the attribute list of the split attribute is divided among the child nodes, which is then used for splitting the remaining attribute lists of the node. The method reduces I/O read time by combining the read for partitioning the records at a node with the read required for determining the best split test for the child nodes. Further, it requires writes of the records only at one out of n levels of the decision tree where n>/=2. Finally, a novel data layout on disk minimizes disk seek time. The I/O optimizations work in a general environment for hierarchical data partitioning. They also work in a multi-processor environment. After the generation of the decision tree, any prior art pruning methods may be used for pruning the tree.

A database system is capable of executing a database application that transfers a logical object in multiple fragments. The database system comprises a main storage site, a remote storage site, a main protocol executable on the main storage site, and a remote protocol executable on the remote storage site. The remote storage site is capable of linking to the main storage site and mirroring information stored in the main storage site. The remote storage site includes a storage and a cache sidefile divided into a plurality of array sidefile recordsets. The main protocol is capable of including information indicative of logical object fragment commencement and completion in the multiple fragment database application transfer. The remote protocol is capable of controlling the cache sidefile to cache the multiple fragments as received and to enable destaging of the logical object to the storage on receipt of all fragments.

A technique for identifying related transaction records from a database storing transaction records for multiple entities includes grouping transaction records with a common attribute value into transaction record sets, receiving a selection of an exemplar record set and determining the probability the transaction record set stores transaction records associated with a first entity. Other operations include resolving the transaction record set as storing transaction records associated with the first entity. This improves the process of identifying related transaction records because related transaction records missed by string comparisons transaction record attributes are detected.

An in-memory storage manager represents XML-compliant documents as a collection of objects in memory. The collection of objects allows the storage manager to manipulate the document, or parts of the document with a consistent interface and to provide for features that are not available in conventional XML documents, such as element attributes with types other than text and documents that contain binary rather than text information. In addition, in the storage manager, the XML-compliant document is associated with a schema document which defines the arrangement of the document elements and attributes. The schema data associated with a document can contain a mapping between document elements and program code to be associated with each element. The storage manager further has methods for retrieving the code from the element tag. The retrieved code can then be invoked using attributes and content from the associated element and the element then acts like a conventional object. Further, the storage manager allows real-time access by separate process operating in different contexts. The objects that are used to represent the document are constructed from common code found locally in each process. In addition, the data in the objects is also stored in memory local to each process. The local memories are synchronized by means of a distributed memory system that continually equates the data copies of the same element in different processes. Client-specified collections are managed by a separate collection manager. The collection manager maintains a data structure called a “waffle” that represents the XML data structures in tabular form. A record set engine that is driven by user commands propagates a set of updates for a collection to the collection manager. Based on those updates, the collection manager updates index structures and may notify waffle users via the notification system.

A smart folder for a selected set of documents or records in a document management system, which documents or records have a unique identity, with the smart folder being associated with software for handling the documents or records in a substantially automated manner in accordance with predetermined rules associated with the selected set of documents or records.

Systems and methods for managing data in compliance with privacy, security and/or retention standards in business industries. A dynamic and customizable archival and retrieval system allows for information and documentation to be placed and made available in the system. The document type and identifying information for that document type are described. Definitions are established for the documents being managed, the data identifying the documents, and the retention policies for the documents. The documents are associated with the identifying data for a particular set of records. A single point of entry is provided for external and/or internal requests, and/or a single point of exit is provided for transmissions of information, wherein the transmissions to requestors include information that is individually approved. Moreover, digital authorizations and consents for retrieval from external data sources may be utilized.

A method for realigning a database server and a client database is provided. During realignment at least one table of the database server is copied to a workspace, and a set of records copied to the workspace is identified that are associated with the client. The set of records associated with the client are modified and can include a subset of records newly associated with the client. An association-rule is created that defines the modified set of records as accessible by the client and includes an effective time. The association-rule and the newly associated records are distributed to the client, preferably during database synchronization. At the effective time, the modifications to the workspace records are made effective on the server and activated on the client. Optionally, the association-rule and the newly associated records are distributed in response to receiving approval of the modified set of records.