Abstract: Implementations provide an indexing system with near-instant updates to an inverted index while maintaining techniques for query optimization. The system may provision empty positions in posting lists to enable in-place updating, without having to rebuild the posting list or append updates to the end of the posting list. For example, a system comprises at least one processor and memory storing an index that includes at least one posting list that maps a term to a set of the documents. The posting list includes an ordered list of documents and has a plurality of open positions within the ordered list. The memory also stores instructions that, when executed by the at least one processor, cause the system to locate an open position of the plurality of open positions for a new document and to insert the new document into the at least one posting list using the open position.

Abstract: An optimized fact checking system analyzes and determines the factual accuracy of information and/or characterizes the information by comparing the information with source information. The optimized fact checking system automatically monitors information, processes the information, fact checks the information in an optimized manner and/or provides a status of the information. In some embodiments, the optimized fact checking system generates, aggregates, and/or summarizes content.

Abstract: A system, method and computer product for allowing users to evaluate search results from one or more search engine, including the logic and data associated with the search engine in evaluation windows displayed relative to the displayed search results.

Abstract: In one aspect, a method includes extracting configuration files from a deduplication device, configuring a storage array based on the configuration files extracted, extracting data for a point-in-time (PIT) from the deduplication device and sending the data for the PIT extracted to the storage array. In another aspect, an apparatus includes electronic hardware circuitry configured to extract configuration files from a deduplication device, configure a storage array based on the configuration files extracted, extract data for a PIT from the deduplication device and send the data for the PIT extracted to the storage array. In a further aspect, an article includes a non-transitory computer-readable medium that stores computer-executable instructions.

Abstract: A computing system recovers volumes in a distributed computing environment while reducing downtime of storage servers. In an embodiment, a storage server contacts a control plane after a storage failure has occurred. If the storage server hosts an authoritative copy of an offline volume, the storage server is requested to restore the volume. Non-authoritative volumes are removed from the storage server and the storage server provides read access to the restored volume while resuming storage services.

Abstract: Techniques and tools are described for producing time-series data using faceted search based on document creation time. For example, index information can be created from events (e.g., by adding meta-data and indexing the events as documents). In addition, index information can be created that maps document creation time to time ranges. Search queries can then be executed (e.g., comprising ad-hoc filters to filter on the meta-data), and search results can be faceted on the time ranges to produce time-series data. The time-series data can be graphed to display trends of activity (e.g., trends of events based on user activity).

Abstract: Embodiments are directed to a method for preserving temporal locality in disk-based backup systems by receiving a plurality of save streams each comprising a data stream and a metadata stream, directing the data streams to a plurality of respective data containers, and the metadata streams to a single shared metadata container, and assigning metadata streams using the shared metadata container to their own respective compression region to preserve locality at the compression region level.

Abstract: A computer-implemented method for initiating, at a user interface, execution of a software application implementing a plurality of business processes associated with a plurality of business objects, and displaying, in the user interface, a query box and a plurality of visualizations depicting data corresponding to at least a portion of the plurality of business objects. The method includes receiving and parsing a free text input, generating and executing a search using a plurality of keyword search queries based on one or more keyword tokens. The method also includes applying grammar rules, generating query trees, and generating a number of search suggestions using the query trees.

Abstract: The operation of a machine can be controlled by performing reconciliation using a cluster of nodes. In one example, a node can receive parent timestamped data from a parent dataset and child timestamped data from child datasets that are children of the parent dataset in a hierarchical relationship. The parent timestamped data and the child timestamped data can relate to an operational characteristic of the machine. The node can generate computer processing-threads. Each computer processing-thread can solve one or more respective reconciliation problems between a parent data point that has a particular timestamp in the parent timestamped data and child data points that also have the particular timestamp in the child timestamp data to generate a reconciled dataset. An operational setting of the machine can then be adjusted based on the reconciled dataset.

Abstract: Systems and methods of generating and using a bitmap index are disclosed. The bitmap index stores bit strings. In a particular implementation, each bit string in the bitmap index corresponds to an attribute. Each location in each bit string corresponds to the same source. The bitmap index supports parallelized and distributed execution of queries with respect to data indexed by the bitmap index. For example, the described bitmap index can be used to index advertising data, healthcare data, financial data, etc.

Abstract: The disclosed embodiments provide a remembered set implementation for use during an incremental garbage collection, wherein the implementation includes a trie that can be dynamically coarsened to conserve memory. During operation, responsive to storing a reference into a location in a referenced memory area during the execution of a software program, the system finds, within a trie that serves as a remembered set for the referenced memory area, a particular entry that corresponds to a particular address range that covers the location. The system then marks the particular entry to indicate that the particular address range should be processed during a garbage collection. Based on a policy, the system then coarsens a particular subtree of the trie in which the particular entry is stored. Next, during the garbage collection, the system processes a particular larger address range when a root entry of the particular subtree is visited.

Abstract: Disclosed are some examples of database systems, methods, and computer program products for processing log files. In some implementations, log files can be accessed and identifiers can be generated for the data entries of the log files. The generated identifiers can be used to determine whether data entries in the log files are new, and therefore, should be extracted for analysis.

Abstract: Repairing corrupt database references. Identifying a corrupt reference within a database, whereby the corrupt reference includes a reference with a broken connection between one or more data objects within the database and the corrupt reference is associated with one or more reference corruption types. Recording reference information for the corrupt reference, whereby the reference information includes a location of the corrupt reference within the database and one or more identification numbers of the one or more data objects associated with the corrupt reference. Determining a repair procedure based on the one or more reference corruption types associated with the corrupt reference. Generating one or more lines of computer code associated with the repair procedure and based on the recorded reference information. Executing the one or more lines, whereby the one or more lines are executed in a database manager.

Abstract: Techniques for leveraging frequent patterns identified in a captured workload are provided. In one approach, multiple frequent patterns detected in a captured workload may be ordered by frequency to determine, for example, which patterns should be targeted for optimization. In another approach, a model of a captured workload is created, where the model comprises nodes that represent templates (which in turn correspond to requests) and edges that represent transitions between templates. The model is used to create an artificial workload, such as a workload that is twice as large as the originally-captured workload. The model may also be edited before creating the artificial workload. In another approach, workload models are compared to identify errors, regressions, or security issues. In another approach, an artificial workload is created for an application that is not yet deployed and then executed to determine whether the artificial workload or the originally-captured workload executed faster.

Abstract: A computer-implemented system and method for providing a data rerepresentation is provided. A representation of data from a first application is identified and a rerepresentation of the data from the first application is generated. The rerepresentation includes one of a modification format rerepresentation that changes a presentation of the data and a projection format rerepresentation that provides one of more or less data in the rerepresentation than the first application by overlaying at least a portion of the data from the first application over data from a second application using ancillary data identified from the data of the first application or data from a separate application. Actions from a user are received within the rerepresentation and are applied to the data of the representation from the first application.

Abstract: Embodiments of the present disclosure set forth methods for selecting a preferred data set from distributed databases including a first database having a first probability attribute and a second database having a second probability attribute. One example method may include receiving a first data set from the first database and a second data set from the second database. The first data set includes a first monotonic attribute. The second data set includes a second monotonic attribute. It may further include selecting a candidate data set from one of the first data set and the second data set based on a comparison of the first monotonic attribute and the second monotonic attribute and determining whether the selected candidate data set is the preferred data set.

Abstract: A method for providing of data is provided, the method comprising at a first database: providing of group data; providing of data of a first entity, in particular of a first device, the data of the first entity comprising the group data; receiving from a second database a request for the data of the first entity; determining that the data of the first entity comprises the group data and that said group data has not been sent to the second database before; and if said determining step is in the affirmative, sending the data of the first entity comprising the group data to the second database.

Abstract: A method performed in a processing unit for determining calibration data to be used when processing data from a sensor unit connected to the processing unit, the method including receiving, from the sensor unit, an identifier which identifies and is calculated based on calibration data stored in the sensor unit, checking if there is an identifier stored in the processing unit identical to the received identifier, where the identifier stored in the processing unit identifies and is calculated based on calibration data stored in the processing unit, if an identical identifier is stored in the processing unit, using the calibration data stored in the processing unit identified by the identical identifier when processing data from the sensor unit, if no identical identifier is stored in the processing unit, requesting the sensor unit to transmit calibration data, and using the requested calibration data when processing data from the sensor unit.

Abstract: A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.

Abstract: A system and method for database persistence of transaction logs (TLOGs). Embodiments of the invention allow an administrator to configure their system to associate one or more Java Database Connectivity (JDBC) TLOG stores with a data source or database instead of a file system, for use in storing the primary TLOG. This provides an opportunity to exploit the high availability features of a database system; improve handling of disaster recovery scenarios, such as cross-site recovery using database replication; and alleviate the need for third-party distributed file system components, together with their cost and complexity.