Abstract: A method for performing row qualification in database table retrieval and join operations. This method, referred to as bulk qualification, evaluates conditions on multiple rows in a database table at the same time, providing more efficient utilization of memory bandwidth and CPU throughput.

Abstract: Systems, methods, and non-transitory computer readable media can obtain a plurality of ephemeral content collections that are candidates for an ephemeral content feed of a user, wherein each of the plurality of ephemeral content collections includes one or more ephemeral content items. A score for each of the plurality of ephemeral content collections can be determined based at least in part on a probability of the user selecting the ephemeral content collection. The plurality of ephemeral content collections can be ranked based on the respective scores of the plurality of ephemeral content collections.

Abstract: Systems, methods, and non-transitory computer-readable media can identify a verified entity who is verified based on a verification process. A set of questions directed to the verified entity can be received from a set of question providers. The set of questions can be ranked based on question ranking criteria. At least one response to at least one question in the set of questions can be received from the verified entity. Access to the at least one response can be provided.

Abstract: An apparatus, method and system facilitate efficient creation of virtual places and provide tools for using the virtual places. The virtual places include a virtual real estate listing, newsworthy place and a virtual box seat. Tools are provided including an automatic declutter tool and a staging tool.

Abstract: Systems and methods are disclosed for optimizing full-spectrum cardinality approximations on big data by exploiting an underlying relationship between LogLog counting estimation techniques and order statistics-based estimation techniques. To accomplish the foregoing, a multiset of objects that each corresponds to one of a plurality of objects associated with a resource are obtained by a computing device. A compound data object is populated by the computing device with data that is derived based on generated hash values that correspond to each object in the obtained multiset. The populated compound data object is processed utilizing a processor with a full-spectrum unified estimation operation that can accurately determine a cardinality estimate for the obtained multiset, utilizing considerably less resources when compared to traditional and state of the art techniques.

Abstract: Generating a database query using a dimensional hierarchy within a graphical user interface including displaying a data set within a spreadsheet structure, wherein the data set comprises a plurality of columns; displaying a list structure comprising a first level and a second level; receiving a selection of a first column of the plurality of columns as a first key for the first level in the list structure; receiving a selection of a second column of the plurality of columns as a second key for the second level in the list structure; and in response to receiving the selection of the first column and receiving the selection of the second column and based on an order of the first key and the second key in the list structure, generating the database query defining a hierarchical relationship between the first column and the second column.

Abstract: The present invention provides a Distinct Author Identification System (“DAIS”) for disambiguating data to discern author entities and link or associate authorships with such author entities. The invention provides powerful disambiguation processes applied across one or more databases to yield a disambiguated authority database of authors. An entire database of publications may be processed by the DAIS to group/link authorships and to identify author entities. The author entities may then be matched or associated with actual authors to establish an authority database of authors. After initial evaluation, the DAIS may be used to reevaluate some or all of the database(s) and/or the authority database established by the DAIS may be used to add or update information. DAIS may use “hierarchical clustering” to link authorships and identify authors based on authorship similarity. DAIS evaluates the likelihood that authorships are from the same author.

Abstract: The disclosed computer-implemented method for generating a topic tree for digital information may include parsing the digital information and extracting a set of keywords. This method may also include comparing the set of keywords to an ontology and extracting hierarchies from the ontology that match the set of keywords. The extracted ontology entries may then be pruned and sorted. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems and methods for improved data conversion and distribution are provided. A data subscription unit is configured to receive data and information from a plurality of data source devices. The data subscription unit is in communication with a virtual machine that includes backtesting utility configured to generate backtesting data using one or more statistical models and one or more non-statistical models. The backtesting utility may translate the backtesting results into one or more interactive visuals, and generate a graphical user interface (GUI) for displaying the backtesting results and the one or more interactive visuals on a user device. The backtesting utility may update one or more of the displayed backtesting results and the one or more interactive visuals without re-running the modeling steps.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Abstract: In a distributed storage of data objects in a cluster system, a data object is distributed across a group of node apparatuses in units of data blocks. For each child object, the metadata structure of the respective child object is stored to one of the node apparatuses of the group of node apparatuses for managing locations of data blocks of the data object and includes a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes; and the metadata structure of the parent object is distributed across the plural node apparatuses of the group of node apparatuses for managing locations of child objects of the data object and includes, on each node apparatus of the group of node apparatuses, a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes.

Abstract: Described herein are technologies that facilitate effective use (e.g., indexing and searching) of non-text machine data (e.g., audio/visual data) in an event-based machine-data intake and query system.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dynamically generating indicators of entity locations on an electronic map corresponding, for example, to a suggested search request. In one aspect, a method includes providing an electronic map of a geographic area for display on a user interface, receiving a character string entered into the user interface, the character string representing a partial search query, determining a suggested search request based on the character string, and identifying an entity responsive to the suggested search request and a geographic location for the identified entity. An indicator identifying the geographic location of the entity is provided for display on the electronic map.

Abstract: A system includes: a processor; and a memory, wherein the memory stores instructions that, when executed by the processor, cause the processor to: retrieve a first log over a network from a first server of a plurality of servers for at least one contact center; generate an index of values in the first log; update an index database based on the index; and save the first log on a storage device.

Abstract: According to a specific implementation manner that a questioning and answering system including a transaction node interacts with a user in the embodiments of the present invention, a quick call to an existing function or service can be realized, and by acquiring modification information for a set system component in the questioning and answering system, and correspondingly updating the questioning and answering system according to the modification information, the existing questioning and answering method based on a questioning and answering system, the existing method for generating the questioning and answering system, and the existing method for modifying the questioning and answering system are optimized, thereby improving efficiency and accuracy of questioning and answering, and improving generation efficiency and modification efficiency of the questioning and answering system.

Abstract: Methods and systems for identifying and locating assets. Data can be transmitted at regular intervals from a client to a server for processing by the server and stored in a database associated with the server. Such data characterizes the behavior of a user with respect one or more assets that communicate electronically with the server. Based on the data in the database, an indication of the status of the asset (or assets) can be determined. This indication is then utilized to assist in identifying and/or locating the asset.

Abstract: In a system for storing in memory a tensor that includes at least three modes, elements of the tensor are stored in a mode-based order for improving locality of references when the elements are accessed during an operation on the tensor. To facilitate efficient data reuse in a tensor transform that includes several iterations, on a tensor that includes at least three modes, a system performs a first iteration that includes a first operation on the tensor to obtain a first intermediate result, and the first intermediate result includes a first intermediate-tensor. The first intermediate result is stored in memory, and a second iteration is performed in which a second operation on the first intermediate result accessed from the memory is performed, so as to avoid a third operation, that would be required if the first intermediate result were not accessed from the memory.

Abstract: Methods, non-transitory computer readable media, and computing devices that accelerate data access requests. With this technology, a hierarchy of a plurality of objects is inserted into a location database. Each of at least a subset of the plurality of objects comprises a physical storage location for data stored in a filesystem. One or more of the plurality of objects includes an object version number and a parent version number of a parent one of the plurality of objects. A determination is made when an invalidation event has occurred in the filesystem. The invalidation event is associated with one of the plurality of objects. The object version number for the one of the plurality of objects is modified to invalidate one or more of the subset of the objects, when the determining indicates that the invalidation event has occurred in the filesystem.

Abstract: A data de-duplication in a distributed storage of data objects in a cluster system, in which plural data objects are distributed across a group of node apparatuses and stored in units of data blocks. Each metadata structure including a root metadata node and one or more direct metadata nodes, and optionally including one or more indirect metadata nodes; and a metadata object is stored for managing de-duplicated data blocks based on a metadata structure of the metadata object wherein at least one direct metadata node of the metadata structure of the metadata object includes a block reference pointing to a de-duplicated data block being associated with two or more data objects. Preferably, each of the metadata structures of the two or more data objects being associated with the de-duplicated data block includes a respective direct metadata node including an object reference to the metadata structure of the metadata object.

Abstract: Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.