Abstract: Embodiments are disclosed for a data analysis tool for facilitating iterative and exploratory analysis of large sets of data. In some embodiments a data analysis tool includes a graphical user interface through which an interactive set of field identifiers is displayed. Each of the listed field identifiers may reference fields associated with a set of events returned in response to a search query, the set of events including machine data produced by components within an information technology (IT) environment that reflects activity in the IT environment. In response to user selections of field identifiers included in the displayed set, a data analysis tool may cause display of manipulable visualizations based on values included in fields referenced by the selected field identifiers.

Abstract: The invention relates to a process for searching for a place on the basis of a free request of parameters defined by a user on a peripheral unit connected to a central unit, remarkable in that it comprises the following steps: a step of selecting and grouping types of parameters, spatial cutting of the earth's surface into surface cells, with said cells being associated with a plurality of sensors, associating data with a type of parameters and with a surface cell in order to obtain data sub-sets, processing and storing the data sub-sets, constituting the free request, analyzing the language and the interpretation of the free request, searching for and selecting surface cells associated with the sorted and selected data, displaying the place corresponding to the surface cells found. The invention also relates to a device implementing said process. Uses: Expediting the search for places.

Abstract: Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.

Abstract: Systems, methods, and non-transitory computer readable media configured to determine a degree of separation between a user and a connection within a social network of the user, the connection associated with an interaction from which at least topic is determined. A value of affinity between the user and the connection is determined. A weight reflecting a value of interest similarity between the user and the connection is determined. A term based on the degree of separation, the value of affinity, and the weight reflecting a value of interest similarity is calculated. Terms associated with the at least one topic are combined to generate a composite score associated with the at least one topic to determine whether to present the at least one topic to the user.

Abstract: According to an aspect, a method for correcting an invalid script in a web application includes determining an invalid reference in an invalid script. A storage location is determined in a database corresponding to the invalid reference based on a data relationship mapping, wherein the data relationship mapping indicates the correspondence between the reference and a storage location in the database. An up-to-date value at the storage location is queried and he queried up-to-date value is determined to be the correct value of the invalid reference.

Abstract: Embodiments are disclosed for a data analysis tool for facilitating iterative and exploratory analysis of large sets of data. In some embodiments a data analysis tool includes a graphical user interface through which an interactive set of field identifiers is displayed. Each of the listed field identifiers may reference fields associated with a set of events returned in response to a search query, the set of events including machine data produced by components within an information technology (IT) environment that reflects activity in the IT environment. In response to user selections of field identifiers included in the displayed set, a data analysis tool may cause display of manipulable visualizations based on values included in fields referenced by the selected field identifiers.

Abstract: A systems and methods for determining crowd sentiment based on unstructured data are presented. The system includes scrapers that continuously scour a computer network to obtain one or more published documents and stores the documents in a document repository. The system further processes each of the documents through a filter (or percolator) to extract one or more system keywords, links and statistical information such as number of occurrences of the system keyword, rate of change and direction of change for each system keyword and crowd sentiment for the system keyword. The system further includes a keyword cache system for maintaining the system keywords so that up to date crowd sentiment is available upon demand.

Abstract: Media content search results ranked by popularity is described. In embodiment(s), a search request for television media content can be initiated by a viewer, and television media content that is relevant to the search request can be identified. The relevant television media content can then be ranked based on a popularity rating and the relevant television media content can be displayed in an ordered list that is ordered by popularity rankings.

Abstract: The present invention addresses deficiencies of the art with respect to collaborative computer networks consisting of mixed data, control functions, analysis functions, and sensors in complex systems of systems. The method involves a database framework for representing complex heterogeneous characteristics of processes, systems, and systems of systems that feature many to many interrelationships. The homoiconic graph framework takes the form of an executable graph database, which is often faster for associative data sets, and maps more directly to object-oriented computer applications for large-scale operations. The invention provides a method to execute the graph database, in that the graph comprises nodes that are both data fragments and executable components. The graph is characterized as one or more homoiconic or executable graph frameworks, to distinguish this unique feature from the concept of a graph database, which generally is a repository of connected data only.

Abstract: A method includes traversing a query plan tree having multiple nodes, each node representative of an operation on data that is the subject of a query, to extract multiple pipelines from the query plan tree, identify dependencies between the multiple extracted pipelines, and provide a pipeline dependent tree based on the dependencies between the multiple extracted pipelines for execution of the query by multiple processors.

Abstract: Media content search results ranked by popularity is described. In embodiment(s), a search request for television media content can be initiated by a viewer, and television media content that is relevant to the search request can be identified. The relevant television media content can then be ranked based on a popularity rating and the relevant television media content can be displayed in an ordered list that is ordered by popularity rankings.

Abstract: A database server receives a request from a client application for performing a data transaction on persistent data storage. The request is sent to a set of replication servers. An acknowledgement for the request is received from each replication server, including a start sequence number and an end sequence number for data that is stored in local cache of the replication server, and a latest committed sequence number for data that was written to the persistent data storage by the replication server. A maximum value of latest committed sequence numbers received from the set of replication servers is determined. For each replication server, it is examined whether there is a gap between the start sequence number for data stored in local cache and the maximum value of the latest committed sequence numbers. Based on the examining, it is determined whether there is an occurrence of loss of data.

Abstract: Methods, devices, and systems may be used for semantics publishing and discovery. In an embodiment, a method for publishing semantics related resource identifiers may include adding a key word to an identifier of a semantics related resource and publishing the identifier to at least one of a sibling node and a child node. In another embodiment, a method may include using a Bloom filter to publish a semantics related resource. In another embodiment, a method may include publishing, by a semantics node, an identifier of a semantics related resource to a sibling node, while publishing a digest of the semantics node to a child node.

Abstract: The present disclosure is directed towards methods and systems for providing relevant video scenes in response to a video search query. The systems and methods identify a plurality of key frames of a media object and detect one or more content features represented in the plurality of key frames. Based on the one or more detect content features, the systems and methods associate tags indicating the detected content features with the plurality of key frames of the media object. The systems and methods, in response to receiving a search query including search terms, compare the search terms with the tags of the selected key frames, identify a selected key frame that depicts at least one content feature related to the search terms, and provide a preview image of the media item depicting the at least one content feature.

Abstract: Disclosed herein is a technique for refining search results presented in a graphical user interface of a search application operating at a user device. A scrollable category list is presented in the graphical user interface, where the scrollable category list includes a number of categories related to a search query provided by a user of the user device. Categories that are available within a geographic region associated with a location of the user device are included in the scrollable category list.

Abstract: Data replication groups may be used to store data in a distributed computing environment. A data replication group may include a set of nodes executing a consensus protocol to maintain data durably. In order to increase efficiency and performance of the data replication, a particular node of the data replication group may be assigned the role of master node. The role of master node may be lease in accordance with a consensus protocol. If the lease is not renewed within an interval of time election/selection of a new master node may be commenced.

Abstract: A blockchain may be used to store transactions in an immutable ledger. The types of transactions may vary and the information from the transactions could be used to identify information about nodes in a particular network. One example operation may include one or more of identifying a number of nodes operating on a blockchain, determining a new blockchain transaction, and determining one or more of the nodes as having one or more characteristics based on the new blockchain transaction.

Abstract: Techniques are provided for automatically determining when to trigger instant search. In one technique, while a user is entering text to formulate a search query, and prior to receiving an indication that the user has completed formulation of the search query, a search assistant system determines the most popular queries that include the text the user has already entered. The search assistant system then determines whether to proactively provide, to the user, search results for the top-candidate of those completed queries. That determination may take into account factors such as whether the top-candidate qualifies as a dominant completed query, a richness metric determined for the search results for the particular completed query, and/or a satisfaction metric determined for the search results for the particular completed query.

Abstract: Access to a set of media content items is acquirable. Identified processors can perform, in parallel, object detection for the set. In some cases, information about a current system state, a user, and/or object popularity metrics is acquirable for selecting a subset of object models. Object recognition is performable, based on the subset, for the set of media content items. In some instances, a camera view can be provided. Object recognition is performable for representations of the view. An object depicted in the representations is identifiable. An interface portion is presentable to provide a label for the object. In some cases, object recognition is performable for the set of media content items to identify an object depicted in a content item. A label is associable with the content item. A search through the set of media content items can identify, based on the label, a subset that depicts the object.

Abstract: A method, computer program product, computing system, and system for backing up changed sectors of a virtual disk are described. A method may include determining changed file regions of the virtual disk, the changed file regions being file regions of the virtual disk that changed since a last backup. The method may further include determining changed blocks of the virtual disk, the changed blocks of the virtual disk being blocks of the virtual disk that lie, at least in part, in the changed file regions. The method may also include determining changed sectors for the changed blocks of the virtual disk based upon, at least in part, at least one of: a region offset, a block offset, sector size, and a count of sectors in an associated block. Additionally, the method may include backing up the changed sectors of the virtual disk.