Abstract: A data processing system is disclosed for accessing databases and updated data items and triggering event notifications. The data processing system may comprise a first database including a plurality of records, and a second database including a plurality of trigger indicators. The database system may further include a hardware processor configured to execute computer-executable instructions in order to: receive an update data item; identify a record corresponding to the update data item; cause an update to the record based on information included with the update data item; identify a trigger indicator corresponding to the update to the record; determine that a type of the trigger indicator matches a type of the update to the record; and generate an event notification including information included in the update.

Abstract: A facility for representing a set of items each potentially having a value for each of a group of attributes is described. The items are represented in a database made up of two or more discrete components. Each component corresponds to a proper subset of group of attributes, and represents for every item of the set the values of its proper subset of attributes. Every component is organized such that data items are represented within it in the same order.

Abstract: Embodiments retrieve a set of search results that have been previously identified as having at least one associated date or location. A timeline or map is displayed that visually represents the distribution of the dates or locations within the results. The timeline is displayed with a histogram graph corresponding to the number of dates in the search results at points along the timeline. The map is displayed with markers at the locations corresponding to the locations in the search results. The user can navigate the result set using the displayed timeline or map.

Abstract: A location-aware search assist capability identifies location-aware search query suggestions using location information associated with the location-aware search query suggestions. A user's search query input and location and a location associated with each location-aware search query suggestion candidates may be used to identify a set of search query suggestions for presentation to the user. Location-aware search query suggestion candidates may be ranked in accordance with a closeness of each one's location to the user's location. The ranking may be performed using a score, such as a popularity score associated with each search query suggestion candidate. The location-aware search query suggestion candidates having a location closer to the user's location may be promoted by adjusting each candidate's popularity score upward, and the search query suggestion candidates that are farther away from the user's location may be demoted by adjusting each such candidate's popularity score downward.

Abstract: Methods are presented suitable for clustering computational event logs (2) including a method for calculating a metric distance between characters of different event messages (4) by comparing both characters to a comparative set of characters. Methods are presented for calculating a metric distance between two event messages (4) comprising determining character metric distances between characters in the compared words and word metric distances between the words in the compared events (4), Methods are presented for creating an area (8) in metric space corresponding to a new cluster (6) when a further event message (26) is found in an overlap region (24) of existing clusters (6, 8). Methods are presented in populating and constructing an event table.

Abstract: A method for extracting entities from a text document includes, for at least a section of a text document, providing a first set of entities extracted from the at least a section, clustering at least a subset of the extracted entities in the first set into clusters, based on locations of the entities in the document. Complete ones of the clusters of entities are identified. Patterns for extracting new entities are learned based on the complete clusters. New entities are extracted from incomplete clusters based on the learned patterns.

Abstract: Data structures can provide for a column store of a database table. Methods can use the data structures for efficiently responding to a query. Unique field values of a column of a database table can be identified. The unique values can be stored in a dictionary table along with reference keys that point to a row of the database table. A reference store column can replace the original column, where the reference store column stores index values of the dictionary table. A hash table can be used in accessing the database. A hash function can provide a hash value of a query term, and the hash value can be used to access a hash table to obtain a stored value of an index value of the dictionary table. The index value can be used to access the dictionary table to obtain reference keys corresponding to rows of the database table.

Abstract: This invention relates to a system and methods for determining the placement of an object in a distributed key-value store by mapping the object to nodes in multidimensional hyperspace. A search function supports efficient object retrieval, even when the search query requests multiple objects and specifies them through non-primary keys. In response to a search query, the search is translated into hyperregions in the hyperspace to determine the set of nodes that hold the queried data object. The number of contacted nodes and the number of scanned objects are significantly reduced in comparison to prior art techniques.

Abstract: One or more techniques and/or systems are provided for performing host side deduplication. Host side deduplication may be performed upon writeable data within a write request received at a host computing device configured to access data stored by a storage server. The host side deduplication may be performed at the host computing device to determine whether the writeable data is already stored by the storage server based upon querying a host side cache comprising data stored by a storage server and/or a data structure comprising unique signatures of data stored by the storage server. If the writeable data is stored by the storage server, then a deduplication notification excluding the writeable data may be sent to the storage server, otherwise a write command comprising the writeable data may be sent. Accordingly, unnecessary network traffic of redundant data already stored by the storage server may be reduced.

Abstract: Methods and systems for identifying information based on matching information to a query based on an index value are disclosed. In one aspect, a method for identifying information entered by a user includes computing an numeric index value, receiving input, calculating a query value, comparing the query value to the index value, and displaying items from the dataset.

Abstract: A method, an apparatus, and a system for configuring, designing, and/or implementing integrated data modeling methods for configuring interoperability between multiple data system based upon compliance with data integration standards.

Abstract: A system and method for obtaining a request to perform a data operation with a volume, wherein the volume is a logical storage space in which data objects may be stored, determining a plurality of zones for performing the data operation with the volume, wherein each zone of the plurality of zones comprises a series of sectors of a computer-readable storage medium that forms an append-only section of the computer-readable storage medium, and performing the data operation with the volume on the plurality of zones.

Abstract: In embodiments, methods and systems for controlling access to custom objects are provided. These techniques for controlling access to custom objects can enable embodiments to utilize a key for the protection of the security of data that is to remain private while not compromising efficiency of a query. The key for a requested custom object is identified and then used so that only an appropriate portion of a custom entity share table is searched to locate access information. It is then determined whether the user can access at least a portion of the custom object, and the appropriate and allowed data is sent to the user.

Abstract: Embodiments are directed to managing documents where clauses in a document may be identified. Evaluations of the clauses may be provided based on evaluators and machine learning (ML) models that assign each of the clauses to a category and a confidence score. Actions associated with the clauses may be monitored including updates to content of the clauses. Inconsistent evaluations associated with the clauses be identified. The ML models may be retrained based on the content of the clauses associated with the inconsistent evaluations.

Abstract: A method for use by a source storage unit of a dispersed storage network includes identifying a slice name corresponding to a slice to migrate from a source storage unit to a destination storage unit; sending the slice to migrate to the destination storage unit; generating a slice verification request and sending the slice verification request to the destination storage unit; receiving an integrity value from the destination storage unit; and determining when the integrity value compares favorably to the slice verification request. When the source storage unit determines that the integrity value compares favorably to the slice verification request, a slice name assignment associated with the slice name is updated and the slice is deleted from the source storage unit.

Abstract: Storing a subset of a database on a mobile device. The subset of the database stored on the mobile device being based on privilege information associated with the mobile device and/or a user of the mobile device. One of more mobile applications can access the subset of the database stored on the mobile device when the mobile device is offline and unconnected to a database management system associated with the database. A set of queries can be performed on the subset of the database stored on the mobile device.

Abstract: A search engine: (i) receives a search query including a subject-matter-describing data set, a first boundary-condition-describing data set and a second boundary-condition-describing data set; (ii) determines a first boundary condition based on the first boundary-condition-describing data set; (iii) determines a second boundary condition based on the second boundary-condition-describing data set; and (iv) finds search results that meet the following criteria: (a) apparently relate to the subject matter of the subject-matter-describing data set, and (b) apparently fall between a first boundary condition and a second boundary condition. Also, a user specifies a document, along with a search query, and the search engine uses the document to limit and/or organize the search results.

Abstract: Disclosed aspects relate to data arrangement management in a distributed data cluster environment of a shared pool of configurable computing resources. In the distributed data cluster environment, a set of data is monitored for a data redistribution candidate trigger. The data redistribution candidate trigger is detected with respect to the set of data. Based on the data redistribution candidate trigger, the set of data is analyzed with respect to a candidate data redistribution action. Using the candidate data redistribution action, a new data arrangement associated with the set of data is determined. Accordingly, the new data arrangement is established.

Abstract: A method for tagging multimedia content elements is provided. The method comprises receiving at least one multimedia content element from a user device; generating at least one signature for the at least one multimedia content element; generating at least one tag based on the least one generated signature, wherein the at least one tag is searchable by the user device; and sending the tag generated for the received multimedia content element to storage on the user device.

Abstract: A new approach is proposed that contemplates systems and methods to determine temporality of a query in order to generate a search result including a list of objects that are not only based on matching of the objects to the query but also based on temporality analysis of the query. Here, the temporality of the query can be defined as the distribution over time of the objects matching the query, i.e., the chronology histogram of the query. Such distribution can be analyzed to provide a classification of the intent of the query. Classification of the intent of the query can result either in discrete classification of the query into categories, or in continuous classification of the query which may be a scalar or vector value resulting from transformations of the chronology histogram.