Abstract: According to one aspect of the present disclosure, a computing device is provided, including non-volatile memory storing a database including a plurality of database entries. The computing device may further include a processor configured to sort the plurality of database entries into a plurality of database entry length sets. For each database entry length set, each database entry included in the database entry length set may be within a predefined length range. For each database entry length set, the processor may be further configured to generate a probabilistic data structure based on the one or more database entries included in the database entry length set.

Abstract: Systems, methods, and computer-readable media are disclosed for randomized file segmentation and storage. Example methods may include separating, by a system comprising a plurality of servers, a data file into a plurality of file fragments, sending a first file fragment to a first randomly selected server of the plurality of servers, determining a first token having a random expiration time, causing the first token to be stored at the first randomly selected server in association with the first file fragment, sending a second file fragment to a second randomly selected server of the plurality of servers, determining a second token having a random expiration time, and causing the second token to be stored at the second randomly selected server in association with the second file fragment.

Abstract: The usefulness of a search engine depends on the relevance of the result set it returns. Search problems in a particular domain require an understanding of the user's intent that traditional search methods lack, including a sense of time, domain and situational context, user preferences and the history of previous searches in the domain of interest. In an age in which speaking to technology is becoming the norm and user expectations are skyrocketing, semantic search is more important than ever. The disclosed technology describes systems and methods for implementing natural language search with semantic mapping and classification. The technology further discloses systems and methods for including social search, making it possible for users to include input from friends in search results. The disclosed technology offers a customizable flexible technology designed to be taught about a domain and to be able to systematically adapt to its unique needs.

Abstract: A query comprising a graph pattern comprising a plurality of graph triples of node-edge-node is received. A graph database comprising a plurality of graph patterns is accessed and a plurality of graph patterns in the graph database that match the received query are identified. An inverse frequency for each graph triple of the received query in the accessed graph database is calculated and from this a score for each graph pattern in the graph database that matches the received query is also calculated, the score comprising a sum of the inverse frequencies for each graph triple contained within the respective graph pattern. The plurality of graph patterns in the graph database that match the received query are then ranked according to their respective calculated scores.

Abstract: A method, system, apparatus, article of manufacture, and computer-readable storage medium provide the ability to merge multiple point cloud scans. A first raw scan file and a second raw scan file (each including multiple points) are imported. The scan files are segmented by extracting segments based on geometry in the scene. The segments are filtered. A set of candidate matching feature pairs are acquired by registering features from one scan to features from another scan. The two raw scan files are merged based on the candidate matching feature pairs.

Abstract: The present invention provides a system for publishing and displaying digital materials, comprising an ePub publishing module comprising a mechanism for publishers to upload ePub files, a user management module providing a means to add, edit and remove end users from the system, a bookshelf module for organizing the user's content in order to create a logical grouping of content, a reading content module for reading content after the user has been mapped to the content, and an annotating content module for annotating user selected text.

Abstract: Automated Index Management entails automated monitoring of query workload in a DBMS to determine a set of higher load queries to use to evaluate new potential indexes. Without the need of user approval or action, the potential indexes are automatically created, evaluated and tested, and then made available for system wide use for executing queries issued by end users. Indexes created by Automated Index Management are referred to herein as auto indexes.

Abstract: Examples of techniques for constructing, evaluating, and improving a search string for retrieving images are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method includes receiving, by a processing device, a plurality of images returned as results to an executed search string in the form of a tuple including an item class, an action and an actor. The method further includes generating, by the processing device, a collection similarity score by comparing at least one of the plurality of images to at least one other of the plurality of images. The method further includes determining, by the processing device, whether the collection similarity score exceeds a collection threshold. The method further includes, based at least in part on determining that the similarity score does not exceed the collection threshold, indicating that the search string is ineffective at indicating the item use.

Abstract: Examples of techniques for constructing, evaluating, and improving a search string for retrieving images are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method includes receiving, by a processing device, an item identifier. The method further includes retrieving, by the processing device, an item description based at least in part on the item identifier. The method further includes identifying, by the processing device, a tuple indicating a common item use based at least in part on the item description. The method further includes constructing, by the processing device, a search string based at least in part on the tuple. The method further includes retrieving, by the processing device, at least one image based at least in part on the search string.

Abstract: A computing resource service provider deploys resources to process input data sets on an ongoing basis and provide requestors with queryable data structures generated from the input data sets over determined, rolling periods of time. In one embodiment, the input data sets are processed using one or more nearest neighbor search algorithms, and the outputs therefrom are represented in data structures which are rotated as newer data structures are subsequently generated. The disclosed systems and techniques improve resource utilization, processing efficiency, query latency, and result consistency relative to known controls for large and/or complex data processing tasks, such as those employed in machine learning techniques.

Abstract: Embodiments are directed towards a method for searching data. The method comprises generating an inverted index that comprises at least one record, wherein the at least one record comprises at least one field name and a corresponding at least one field value. The at least one field name and corresponding value are extracted from time-stamped searchable events that are stored in a field searchable datastore and comprise portions of raw data. The at least one record further comprises a posting value that identifies a location in the field searchable datastore where an event associated with the at least one record is stored. The method further comprises receiving an incoming search query that references a field name. Furthermore, the method comprises generating results to the incoming search query based on the field searchable datastore, wherein the field searchable datastore is directly searchable by the field name.

Abstract: In various exemplary embodiments, a system and associated method predict auto-complete recommendations for a partial search request. A search engine receives a partial search request with one or more characters from a client device. A first set of auto-complete recommendations corresponding to the one or more characters of the partial search request are identified. A second partial search request is predicted that comprises a set of characters with one or more additional characters added to the one or more characters from the partial search request. A second set of auto-complete recommendations corresponding to the second partial search request is identified. The first set of auto-complete recommendations and the second set of auto-complete recommendations are returned to the client device as a response to the partial search request.

Abstract: Embodiments are directed towards a method for searching data. The method comprises providing an inverted index that comprises at least one record, wherein the at least one record comprises at least one field name and a corresponding at least one field value. The at least one field name and corresponding value are extracted from time-stamped searchable events that are stored in a field searchable datastore and comprise portions of raw data. The at least one record further comprises a posting value that identifies a location in the field searchable datastore where an event associated with the at least one record is stored. The method further comprises receiving an incoming search query that references a field name and evaluating the incoming search query. Furthermore, responsive to the evaluating, the method comprises determining results for the incoming search query using both of the field searchable datastore and the inverted index.

Abstract: Methods, computer systems, and computer-storage media are provided for augmenting Web-based search results with relevant content received from third-party applications. Each of a plurality of third-party applications is registered to obtain an indication of entity types associated with the each registered third-party application. A user input including at least a search query is received. The search query is communicated to those third-party applications that are identified as being relevant to the search query. Search results that are relevant to the user input are received from the relevant third-party applications and are presented on a results page.

Abstract: Techniques for automatically linking pages in a web site are provided. In one technique, training data for a machine-learned scoring model is generated that comprises a plurality of features related to content items. The training data comprises multiple entries, each corresponding to a different content item in a first set of content items. For each entry, a corresponding label is based on a ranking of the corresponding content item in one or more search engine results. The machine-learned scoring model is trained based on the training data. For each content item in a second set of content items, multiple attribute values associated with that content item are input into the machine-learned scoring model, which generates a result. Based on multiple results, determining, for a particular web page, a strict subset of the second set of content items to which the particular web page will include one or more links.

Abstract: The present disclosure discloses method and data restoration system for restoring historic data of an enterprise. The data restoration system receives a request from a user through a transformation backup server, for restoring historic data from a legacy storage device of a plurality of legacy storage devices, associated with an enterprise, along with metadata associated with the historic data. The metadata is previously extracted and stored in a format recognizable by the transformation backup server. The data restoration system determines format of the historic data based on the metadata and extracts historic data from the legacy storage device, using at least one of the metadata and a predefined execution process associated with the historic data, based on the format of the historic data. Thereafter, extracted historic data is restored to the user. The present disclosure recovers legacy data as when required without large migration or any data conversion.

Abstract: An approach for improving LOB query performance via automatic inference of locator-less LOB by value semantics in a relational database system is provided. A relational database management system (RDBMS) is implemented to perform operations on LOBs based on the semantics of a statement. During statement compilation, the RDBMS identifies inline LOB column(s) that are not required to be returned to a client. During execution, the identified column(s) are accessed via a shared buffer cache and fed to an operator for evaluation. For inline LOB column(s) that must be returned to the client, during execution, the inline LOB data is copied from the shared buffer cache to a temporary buffer area. Data in the temporary buffer area is fed to an operator for evaluation and is used to create a LOB locator for the inline LOB column(s) that must be returned to the client.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for digital asset management. One of the methods includes: obtaining a request for creating a digital asset corresponding to a tangible asset, wherein the request comprises one or more characteristics of the digital asset; generating a blockchain contract corresponding to the tangible asset based on the one or more characteristics of the digital asset; and deploying the generated blockchain contract on a blockchain, wherein the deployed blockchain contract is executable to issue the digital asset corresponding to the tangible asset.

Abstract: A journal-based process to achieve atomicity in a device driver write operation includes committing a transaction associated with the operation to a journal that include a status indicating the target block is corrupted. Subsequent to committing the transaction, the data is written to the target block. If the write operation is successfully committed, the transaction can be deleted from the journal. If a system crash occurs (e.g., power failure) before the write operation is successfully committed, the transaction remains in the journal and can be used to update block metadata associated with the target block when the system reboots to indicate that it is corrupted; e.g., the target block is a torn write.

Abstract: In a computer-implemented method for updating schema of a database, execution of an application in a computing environment is initiated, where the application persists data in a database, and where the schema of the database is updatable responsive to an update of the application. Responsive to determining that the schema is updated, a first instance of the schema executing in the database is received, a second instance of the schema maintained in the application is received, the first instance of the schema is compared to the second instance of the schema, a difference between the first instance of the schema and the second instance of the schema is determined, and the first instance of the schema is updated to incorporate the difference between the first instance of the schema and the second instance of the schema.