Abstract: A distributed search framework with virtual indexing is disclosed. According to some embodiments, a virtual index that includes a first physical index is created, where the first physical index includes a first number of shards. A request to index a document is received. In response to the request, whether the first physical index has reached a capacity threshold is determined. In response to determining that the first physical index has reached the capacity threshold, a second physical index is automatically created and added to the virtual index, where the second physical index includes a second number of shards. The document is added into the second physical index.

Abstract: A system, method, and computer program includes a communications interface configured to receive a set of industry reports from multiple industry sources, and circuitry to compare one or more attributes of at least two trade lines to identify whether the at least two trade lines are duplicates. The circuitry characterizes as a binary indication whether the comparing indicates the one or more attributes are a match, and display a representation of the binary indication and receive a user-identified indication whether the at least two trade lines are duplicates. The circuitry trains a classifier, records the indication whether the at least two trade lines are duplicates and removes at least one of the at least two trade lines from the set of industry reports, and runs the classifier. Subsequently, a supervised machine learning classifier is trained in fit on the training data and is evaluated for accuracy of the testing data.

Abstract: A system for collaborating on a component according to an exemplary aspect of the present disclosure includes, among other things, a multi-user CAx environment including a data module and an editing module. The data module is configured to access a database corresponding to a component design. The component design corresponds to a group of predetermined functions. The editing module is configured to generate at least one user-defined function operable to characterize the component design, and configured to cause the data module to store data corresponding to the at least one user-defined function to the database. A method for collaborating on a component design is also disclosed.

Abstract: A first user computing device is identified as being collocated with a second user computing device and an invitation is sent over a wireless communication channel for delivery to the first user computing device. The invitation invites the first user computing device to join a collaborative search session with the second user computing device. A first one of a plurality of search contexts is selected for use by the second user computing device within the collaborative search session. The first user computing device uses a second, different one of the plurality of search contexts during the collaborative search session, and presentations of search results within the collaborative search session are organized according to the first search context on the second user computing device and organized according to the second search context on the first user computing device.

Abstract: Methods for analyzing and rendering business intelligence data allow for efficient scalability as datasets grow in size. Human intervention is minimized by augmented decision making ability in selecting what aspects of large datasets should be focused on to drive key business outcomes. Variable value combinations that are predominant drivers of key observations are automatically determined from several competing variable value combinations. The identified variable value combinations can then be then used to predict future trends underlying the business intelligence data. In another embodiment, an observed outcome is decomposed into multiple contributing drivers and the impact of each of the contributing drivers can be analyzed and numerically quantified—as a static snapshot or as a time-varying evolution.

Abstract: Methods and systems are provided for tracking object instances stored on a plurality of network nodes, which tracking enables a global determination of when an object has no references across the networked nodes and can be safely de-allocated. According to one aspect of the invention, each node has a local object store for tracking and optionally storing objects on the node, and the local object stores collectively share the locally stored instances of the objects across the network. One or more applications, e.g., a file system and/or a storage system, use the local object stores for storing all persistent data of the application as objects.

Abstract: A system and method for creating a consistent view of previously backed up data. In one embodiment, a point in time copy of a set of data is requested. The point in time copy includes a base image of the set of data and additional data corresponding to transactions targeted to the set of data which are received during creation of the point in time copy. A subset of the additional data usable to generate a consistent view of the set of data from the base image is determined. A file that includes a set of changes to the base image represented by the subset is created and stored in association with the base image. Responsive to a request for access to the copy, the previously stored subset is utilized to create a consistent virtual view of the copy from the base image.

Abstract: A contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, define, in real-time, qualifier set combinations for work items. Thus, the contact center can create a dictionary of combinations of work item attributes that may be defined as work items are introduced to the system. The definition of the combinations allows for large qualifier sets without the large expenditure of resources to define all possible combinations of attributes for the contact center.

Abstract: An information management apparatus includes: a data receiving section, a collected data storage section, an aggregating section, a feature extracting section, a determining section, and an evaluation data storage section. The data receiving section periodically receives action data showing an action of a user. The collected data storage section stores the action data received by the data receiving section every user. The aggregating section generates a data set every user by aggregating action data containing an approximate content, of the action data stored in the collected data storage section. The feature extracting section extracts an index and a reference showing privacy confidentiality of the data set as a feature to incorporate in the data set. The determining section determines whether or not the privacy confidentiality of the feature of the data set is equal to or higher than a predetermined level. The evaluation data storage section stores the data set which passed the determining section.

Abstract: The invention is directed to providing an improved method of determining available identifiers (IDs) in a database, especially in the context of using available IDs for provisioning services in a telecommunications system. The method performs a database query for a range of IDs and stores candidate IDs in a local pre-fetch ID set.

Abstract: A social networking system receives a query associated with a user and, in response, provides a combined result set comprising objects stored by a social networking system that match the query. The combined result set comprises multiple result sets obtained from different search algorithms. The various objects stored by the social networking system may be of different types representing different concepts, such as user objects, application objects, event objects, location objects, group objects, and hub/page objects, any of which may be included in the result set. The objects of the result set may be further filtered, ordered, and/or grouped based at least in part on known relationships of the user with the objects, such as geographic distances between locations associated with the user and the objects. In one embodiment, one of the search algorithms identifies second-order connections of the user by referring to a connection index that stores a list of the connections of the users.

Abstract: According to one embodiment of the present invention, a method for dictionary encoding data without using three-valued logic is provided. According to one embodiment of the invention, a method includes encoding data in a database table using a dictionary, wherein the data includes values representing NULLs. A query having a predicate is received and the predicate is evaluated on the encoded data, whereby the predicate is evaluated on both the encoded data and on the encoded NULLs.

Abstract: The various embodiments of the invention provide software and metadata structures for a data processing system and method, for applications such as marketing campaign management, speech recognition and signal processing. An exemplary system embodiment includes a first data repository adapted to store a plurality of entity and attribute data; a second data repository adapted to store a plurality of entity linkage data; a metadata data repository adapted to store a plurality of metadata modules, with a first metadata module having a plurality of selectable parameters, received through a control interface, and having a plurality of metadata linkages to a first subset of metadata modules; and a multidimensional data structure. The control interface may modify the plurality of selectable parameters in response to received control information.

Abstract: A transactional file system wherein multiple file system operations may be performed as a transaction. An application specifies that file system-related operations are to be handled as a transaction, and the application is given a file handle associated with a transaction context. For file system requests associated with a transaction context, a file system component manages the operations consistent with transactional behavior. The component handles namespace logging operations in a multiple-level log that facilitates logging and recovery. Page data is logged separate from the main log, with a unique signature that enables the log to determine whether a page was fully flushed to disk prior to a system crash.

Abstract: Systems, methods and program products for computing frequent value statistics such as frequent values in a column in a partitioned relational database, that may be employed across a number of nodes of a partitioned relational database and a case where a column is the single partitioning key of the database table as well as the case where the column is not the single partitioning key of the database table. The technique involves hashing column entries to a hash data set on a node, collecting the hash entries into another hash data set on a coordinating node into a combined hash data set, hashing entries from a table portion residing on the coordinating node into the combined hash data set and computing frequent value from the combined hash data set. Each hash data set is an array of counts and the combined hash data set is a combined array of counts.

Abstract: An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user.

Abstract: A method and apparatus for providing to a user personalized information from an database comprising contributor content records and contributor profile records, based upon a comparison of the user's search query and user profile record with the contributor content records and contributor profile records. The database may contain other content records from which personalized information may be obtained. Contributors may provide additional contributor content records to the database, in exchange for valuable consideration.