Abstract: Apparatuses and methods for private information retrieval are provided. One example method may include receiving a query state machine that is an encoding of a search pattern. The query state machine may include a plurality of states and a transition function that defines a plurality of transitions based on the search pattern. The example method may also include performing a private query against a target query string of a target query record by applying the query state machine to the target query string to develop a private encoding. The method may further include transmitting query results based on the private encoding.

Abstract: A computer-implemented method is provided that includes receiving a search request to perform a search in a time series database, where the time series database stores a plurality of sequences of measured values arranged in chronological order, extracting from the search request a condition for performing the search in the time series database, the condition including a target subsequence to be searched for within the plurality of sequences of measured values within the time series database, selecting a search algorithm to perform the search from a plurality of search algorithms registered to the time series database, based on one or more characteristics of the condition and historical statistic data of one or more historical searches conducted on the time series database, and obtaining a search result from the time series database, utilizing the search algorithm.

Abstract: An intuitive interface that allows a non-technical person to search a computer database without having to understand the underlining database software or its structure by assembling a graphical database query.

Abstract: A plugin is provided to a service that includes a database for storing data corresponding to transactions received by the service and applied to the database. Upon receipt of a transaction to be performed by the service, the plugin receives a message generated by the service and associated with informing another service of the transaction. The message is stored in the database together with the transaction, the message and transaction thereby being in the same transactional context. Upon the transaction being committed, the message is also processed because the transaction and message are in the same single transactional context within the database.

Abstract: Systems and methods for providing interaction data in response to a query from a content provider are provided. One method includes receiving a query from the content provide including a plurality of parameters relating to interactions with a content item of the content provider. The method includes retrieving a set of log file records using the included plurality of parameters and generating a current set of records identifying interaction data with the content item. The method includes comparing the current set of records to a previous set of records generated by the one or more processors for a previous query from the content provider and determining a similarity between the current set of records and the previous set of records. The method includes modifying, if the similarity is above a threshold, the current set of records and providing the modified set of records to the content provider.

Abstract: In one embodiment, a computer-implemented method for object-granular policy assignment in an object storage environment includes: automatically assigning a plurality of objects stored within the object storage environment to one or more policies; and locating one or more of the objects among a plurality of policy rings within the object storage environment based on semantics of the one or more policies. A virtual namespace maps each object to at least one of the policy rings based on the one or more policies assigned to the object; and the virtual namespace is scalable with a number of the plurality of objects stored within the object storage environment. Corresponding systems and computer program products are also disclosed.

Abstract: Methods, systems, and computer-readable media for implementing event-stream searching using compiled rule patterns are disclosed. A rule base is compiled based at least in part on one or more rule patterns. The field names are sorted within the rule patterns. The rule patterns comprise one or more field names and one or more field values. The rule base represents a finite-state machine comprising a plurality of states. A plurality of events are received. The events comprise field names and field values describing events associated with resources in a provider network. The field names are sorted within the events. The rule patterns are evaluated against the events using the rule base. In determining a matched rule pattern for one of the events, the finite-state machine transitions between at least two of the states for the matched rule pattern.

Abstract: Text input data may be aggregated and mapped to create composite text input data for electronic records. A semantic event may be automatically detected, triggered by a semantic rule and associated semantic tag. The detected semantic event may be flagged, and a text mining result database may be updated by adding an entry to the database. An indication associated with the event may be transmitted, and a back-end application computer server may establish a hierarchy for multiple elements of the electronic records. The computer server may determine a weight variable and response variable for each element in the hierarchy and apply a hierarchical credibility weighting methodology to the elements from level 1, representing the least granular level in the hierarchy, to level n, representing the most granular level in the hierarchy, calculated recursively from level n, to determine a final estimated credibility for the electronic records.

Abstract: A computing system has a central processing unit (CPU), a plurality of n digital data repositories R1-Rn, having a common sector size, a file system, and a digital bus connecting the CPU and the plurality of n digital data repositories R1-Rn. The file system receives an original file to be stored of FS bits in size, creates a new file of NFS bits, comprising all the data structure of the original file, NFS evenly divisible by n and by the common sector size, divides the NFS by n, creating n portions P1-Pn, and stores one portion to each disk in the plural array simultaneously.

Abstract: Methods, apparatus and computer program products implement embodiments of the present invention that include selecting an archive storing one or more archived files. Respective locations are identified for each of the one or more archived files, the respective locations are stored to a memory, and using the respective locations in the memory, a corresponding accessible file is defined for each of the one or more archived files. Upon receiving a request to access a given accessible file, a given location in the archive for the given archived file is identified, and the given accessible file can be accessed at the given location. In embodiments where the given accessible file consists of a data file, the given accessible file is accessed by reading data from the data file. In embodiments where the given accessible file consists of an executable file, the given accessible file is accessed by executing the executable file.

Abstract: For adding cooperative file coloring protocols in a data deduplication system using a processor device in a computing environment, a preferred character is represented for file coloring in a file using a code selected from a multiplicity of codes that represent a variety of contexts. The original meaning of the preferred character is retained when representing the preferred character for the file coloring by the code selected from the multiplicity of codes. The file is deduplicated by the data deduplication system according to the file coloring that represents a source file of a backup application.

Abstract: Techniques for flexibly controlling data uniqueness which are applicable to different types of data that require different data uniqueness control. Control information mapped by a data storage space of a database is determined. The control information and data to be written into the data storage space is combined to obtain a combination result. The techniques of the present disclosure determine whether there is another combination result that is the same as the combination result. The techniques of the present disclosure, in response to determining that there is another combination result that is the same as the combination result, reject to write into the data storage space the data to be written into the data storage space of the database; or modify the another data in the database.

Abstract: A database may store a plurality of database revisions corresponding to a time period, including a current version and one or more backup versions of a data object. After a threshold time has passed, the database may identify a plurality of time intervals within the time period and identify, for each of the plurality of time intervals, at most one database revision corresponding to the time interval. The database may delete, for each of the plurality of time intervals, all of the database revisions except for the identified at most one database revision. The database may periodically repeat this process to reduce the granularity of backup data over time.

Abstract: Disclosed is a system and method for identifying an organism. At least one database includes electronic organism profile information representing at least one respective physical characteristic associated with a plurality of respective organisms, at least one respective corresponding attribute of the respective organisms, and an identity of at least one of the plurality of organisms, as well as owner information representing at least one person respectively associated with at least one of the organisms. Profile information that includes information representing physical characteristic(s) associated with the first organism associated with a first organism is received. In accordance with at least some electronic organism profile information and at least some of the first electronic profile information, an identity is identified.

Abstract: Various techniques are disclosed herein for storing and managing master data in hierarchical data systems. Several related concepts, embodiments, and examples are disclosed, including techniques for incremental rationalization in a hierarchical data model, techniques for implementing governance pools in a hierarchical data model, techniques for application materialization in a hierarchical data model, techniques for data intersection mastering in a hierarchical data model, techniques for change request visualization in a hierarchical data model, and techniques for hierarchy preparation in a hierarchical data model.

Abstract: Disclosed are various embodiments for discovering availability of digital media titles from multiple digital media service providers. In one embodiment, information is obtained about a relationship between a user account and a first digital media service provider. A request for availability of a digital media title is obtained via a user interface. An availability is determined for access by the user account of the digital media title from the first digital media service provider having the relationship with the user account and a second digital media service provider. An indication of the availability for access of the digital media title by the user account is presented.

Abstract: An in-memory computing system for conducting on-line transaction processing and on-line analytical processing includes system tables in main memory to store runtime information. A statistics service can access the runtime information using script procedures stored in the main memory to collect monitoring data, generate historical data, and other system performance metrics while maintaining the runtime data and generated data in the main memory.

Abstract: Trace data is received for a first execution of a first query on first tables having first data values. Second data values are generated for second tables from the trace data and without accessing the first data values. The second data values are configured to reproduce, by a second execution of a second query, the evaluation states from the first execution. Evaluation states from the first execution are reproduced without accessing the first data values by performing the second execution of the second query on the second data values. The first execution evaluates only a first subset of the first data values and the generating the second data values from the trace data generates second data values corresponding to the first subset. The second execution only evaluates ones of the second data values that correspond to data values of the first subset.

Abstract: A method and system for improving a search query process is provided. The method includes analyzing via a natural language classifier (NLC) circuit of a hardware device, a partial search phase entered in a search field of a graphical user interface with respect to a search query for specified subject matter. A subject based intent classification associated with the search query is determined and compared to intent based data of an intent data repository. In response, an autocomplete phrase associated with the subject based intent classification and the partial search phrase is generated and presented to a user via the graphical user interface.

Abstract: Systems, methods, and other embodiments associated with anomaly detection using tripoint arbitration are described. In one embodiment, a method includes identifying a set of clusters that correspond to a nominal sample of data points in a sample space. A point z is determined to be an anomaly with respect to the nominal sample when, for each cluster, a tripoint arbitration similarity between data points in the cluster calculated with z as arbiter is greater than a threshold.