Abstract: Techniques are disclosed for dynamically generating a data set representative of search results in response to a query and using the data set to accurately rank search results in response to a domain specific search query. Upon receiving the search query, features of the query and features of each search result are extracted. A relevance ranking may be assigned to each search result based on a comparison of the features of the query and each search result. The relevance ranking of each search result may be adjusted based on metrics related to user interactions. A data set may be created which includes the query, search results, extracted features, and metrics. The data set may be used to train a machine learning model to accurately determine a ranking of search results in response to a subsequent search query.

Abstract: In some embodiments, apparatuses and methods are provided herein useful to determining if sensitive data has been exposed externally.

Abstract: Granular performance analysis may be performed for database queries. Database query performance may be monitored. For some database queries, performance of portions of the database query may be measure. The measure performance of the portions may be compared with performance goals that correspond to the portions of the database query. Portions that do not meet or exceed the corresponding performance goals may be identified so that an indication of the identified portions may be provided.

Abstract: A columnar storage method and a query method and system for time series data. The storage method includes: dividing a column of time series data into a plurality of pages, wherein each page stores a part of data points of the column of time series data and the sum of the data points stored in all the pages is all the data points in the column of time series data (S1); and setting two parts, i.e., a page header and a page body, for each page, storing summary index information of all the data points in the page in the page header of the page and storing data value information of all the data points in the page in the page body of the page (S2).

Abstract: Computer-implemented systems and methods are disclosed to interface with one or more storage devices storing a plurality of documents, wherein each of the plurality of documents is associated with one or more tags of one or more predefined hierarchies of tags, wherein the one or more hierarchies of tags include multiple dimensions. In accordance with some embodiments, a method is provided to identify one or more documents from the data storage devices. The method comprises acquiring, via an interface, a selection of one or more tags of the one or more predefined hierarchies of tags. The method further comprises identifying one or more documents from the data storage devices in response to the selection, the identified one or more documents having tags that have a relationship with the selected tags, and providing data corresponding to the identified documents for displaying in the interface.

Abstract: Systems and methods for discovering and annotating geo-fences from geo-referenced data are disclosed. The systems and methods input an area of interest containing a plurality of geo-referenced points having associated labels, and divides the area interest into cells. Each cell is assigned an initial label from among the plurality of labels and hierarchical clustering is used to find clusters of cells having a common label based on a maximization of an objective function for each cell with the objective function being dependent upon favoring spatially adjacent cells having a common label and limiting overgeneralization of the common label.

Abstract: A computer system includes a natural language processing (NLP) unit, a storage unit, a user interface and a search engine. The NLP unit analyzes a content source to identify one or more sections containing searchable content and generate section metadata respective to each identified section included in the content source. The storage unit stores the section metadata and the user interface receives a section-scoped query aimed at searching an identified section corresponding to the at least one first section metadata stored in the storage unit without searching an identified section corresponding to at least one second section metadata stored in the storage unit. Based on the section-scoped query, the search engine analyzes the at least one first section metadata stored in the storage unit without analyzing the at least one second section metadata.

Abstract: Users of a graph data store can access an index object for a graph structure in order to obtain information from objects in the graph data structured index by the index object. A query can be received that is directed to an index object. Links to a subset of data objects in the data store included in the index object can be used to access the subset of data objects to perform the query. In some embodiments, data objects can be manually added or removed from the links included in the index object.

Abstract: In some examples, a randomization searching engine is described that enables randomized searching and recommendation of authorized user profiles. The randomization searching engine implements a search routine that identifies search results by prioritizing authorized user profiles, bucketizing authorized user profiles, categorizing authorized user profiles results, collating authorized user profiles, and generating a set of search results.

Abstract: Ad-hoc table retrieval, including: Representing each of a plurality of tables as a multi-field text document in which: different modalities of the table are represented as separate fields, and a concatenation of all the modalities is represented as a separate, auxiliary field. Receiving a query. Executing the query on the multi-field text documents, to retrieve a list of preliminarily-ranked candidate tables out of the plurality of tables. Calculating an intrinsic table similarity score for each of the candidate tables, based on the query and the auxiliary field. Calculating an extrinsic table similarity score for each of the candidate tables, based on a cluster hypothesis of the candidate tables. Combining: the preliminary rankings, the intrinsic table similarity scores, and the extrinsic table similarity scores, to re-rank the candidate tables.

Abstract: A system for performing data trend analysis is disclosed. The disclosed system categorizes a number of transaction records based on their associated merchant IDs. For each of the merchant ID, the system determines whether the determined number of transaction records exceeds a pre-determined threshold. In response to identifying a merchant ID with the determined number of transaction records that exceeds the pre-determined threshold, the system identifies a location associated with the merchant ID and generates a trending notification indicating a transaction burst. The system then identifies a set of users located in the location that have a transaction history with the merchant ID and sends the trending notification to the set of users.

Abstract: A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives.

Abstract: The present teaching relates to providing a query suggestion. In one example, a request is received for query suggestions with respect to a query prefix input by a user. A plurality of query suggestions is determined based on the query prefix and a preceding query input by the user. A degree of popularity of the preceding query is determined. One or more query suggestions are selected from the plurality of query suggestions based on the degree of popularity of the preceding query. The one or more query suggestions are provided as a response to the request.

Abstract: The technology described herein optimally allocates the limited computer storage on the end user device to point of interest data most likely to be used by a map application. The offline point of interest data can include first-tier, second-tier, and third-tier data about different points. The offline data can be selected based on overall usage among all people and also specially tailored for individual users interests.

Abstract: In some embodiments of the present disclosure, techniques are utilized that allow answers to be provided to end users such as health care consumers, based on benefit book documents. The benefit book documents, which do not initially contain machine-readable structural or semantic information, are processed in order to detect structure and create semantic content based on the structure. This semantic content may then be added to a graph that represents the information contained in the benefit book document. A computing device may then use the nodes of this graph to answer questions received from consumers, where templates that provide answers to the questions reference the nodes of the graph.

Abstract: In one aspect, a computer-implemented method useful for migrating hundreds of Terabytes to Petabytes of data to a cloud-computing environment with a data transfer appliance includes the step of providing a data transfer appliance. The data transfer appliance includes an operating system, one or more computing processing units (CPU's), a memory, and a data storage system. The computer-implemented method includes the step of implementing data capture from a data storage system to the data transfer appliance. The computer-implemented method includes the step of storing the dedupe form of the data in the data transfer appliance by; providing a capture utility, wherein the capture utility comprises a data traversal engine and a data read engine.

Abstract: A verification architecture described according to embodiments of the present invention validates changes made to metadata and may comprise one or more subsystems and phases. According to some embodiments, the “mkfs” volume creation utility works in cooperation with the device driver to create a file system volume by means of reservation and initialization space for metadata structures inside the device's partition that is reserved for the specific file system volume. The storage device uses a verified area legend when checking write requests after the file system volume has been created. The verified area legends may be stored in a dedicated partition or inside the master boot record (MBR) or Globally Unique Identifier (GUID) partition table (GPT) or special memory chip (NAND flash, for example). Write requests that overlap with any extent of reserved metadata area must be verified to prevent metadata corruption.

Abstract: Methods, apparatus, systems and articles of manufacture to build a storage architecture for graph data are disclosed herein. Disclosed example apparatus include a neighbor identifier to identify respective sets of neighboring vertices of a graph. The neighboring vertices included in the respective sets are adjacent to respective ones of a plurality of vertices of the graph and respective sets of neighboring vertices are represented as respective lists of neighboring vertex identifiers. The apparatus also includes an element creator to create, in a cache memory, an array of elements that are unpopulated. The array elements have lengths equal to a length of a cache line. In addition, the apparatus includes an element populater to populate the elements with neighboring vertex identifiers. Each of the elements store neighboring vertex identifiers of respective ones of the list of neighboring vertex identifiers.

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: Integrating a plurality of third party service interactions into a portal including a Web content management system includes receiving a data structure, associating the data structure with a selected profile out of a plurality of profiles based on the origin of the data structure, and transforming content of the received data structure, using a declarative mapping associated with the selected profile, into an intermediate data structure. The intermediate data structure may be provided to a presentation layer of the portal. A signal causing a rendering of the intermediate data structure may be triggered via a portlet of the portal to a display. Captured input from the portlet from the intermediate data structure may be transformed to the data structure using the declarative mapping associated with the selected profile. The data structure may be sent.