Abstract: A method including initiating, by a processing device, a transaction including a plurality of data items in one or more data stores to cause a change to at least a data item of the plurality of data items. The transaction includes a transaction identifier (ID). The method further includes for at least a data item of the plurality of data items, generating transactional data usable to undo the change to each data item associated with the transaction. The method further includes intercepting data items. The method further includes adding the transactional ID and the transactional data to each data item. The method further includes providing the data items to a data store of the one or more data stores.

Abstract: Computer implemented methods for identifying denial constraints are provided herein. The denial constraints can be used with a database schema R. A predicate space P can be generated for an instance I in the schema R. An evidence set EviI can be generated. The evidence set EviI can include sets of satisfied predicates in the predicate space P for each instance I. A minimal set of predicates can be identified for the evidence set EviI. Valid denial constraints can be identified from the minimal set by inverting the predicates in the minimal set.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk. The rolling hash values are used to contribute to the calculation of the similarity search values and to the calculation of the boundaries of the digest blocks.

Abstract: A computerized system including a processor and a computer-readable non-transient memory in communication with the processor, the memory storing instructions that when executed manage a novel data structure and related group of algorithms that can be used as a method for representing a set and as a base for very efficient indexing, hash and compression. SHB is an improvement of hierarchical bitmap. An improved database system that can utilize the innovative data structure which includes a raw data stream provided to the system via a data processing module, data blocks, fields indexes tables and a keys table. There is provided an index creating process and a columns creating process, for transforming the data blocks and tables into index blocks and data columns.

Abstract: An application programming interface for a data storage service provides a convenient mechanism for clients of the data storage service to access its various capabilities. An API call may be made to initiate a job and in response a job identifier may be provided. A separate API call specifying the job identifier may be made and a response providing information related to the job may result. Various API calls may be used to store data, retrieve data, obtain an inventory of stored data, and to obtain other information relating to stored data.

Abstract: A graph representation is described that may be used for data extraction for a data repository. In one example, the graph representation defines an extraction dataset from an object. A selection from a user for a root node is received. Additional are presented for selection by the user based on fields and properties of the selected root node. The root node and selected additional objects are presented as a data graph. The selected objects are joined and presented in the data graph. Finally a dataset is extracted from the object-oriented database based on the data graph.

Abstract: The technology disclosed relates to a platform for ultra-fast, ad-hoc data exploration and faceted navigation on integrated, heterogeneous data sets. The disclosed apparatus and methods for visual data analysis with animated informational morphing replay provide live data rendering on a live dashboard, with flexible display options for analyzing data and conveying analysis results.

Abstract: A semantic search engine is enhanced to employ user preferences to customize answer output by, for a first user, extracting user preferences and sentiment levels associated with a first question; receiving candidate answer results of a semantic search of the first question; weighting the candidate answer results according to the sentiment levels for each of the user preferences; and producing the selected candidate answers to the first user. Optionally, user preferences and sentiment levels may be accumulated over different questions for the same user, or over different users for similar questions. And, supplemental information may be retrieved relative to a user preference in order to further tune the weighting per the preferences and sentiment levels.

Abstract: A sysSQL technology for querying operating system states of multiple hosts in a cluster using a Structured Query Language (SQL) query is disclosed. An administrator of a cluster can use a graphical or text-based user interface to submit an SQL query to determine the operating system states of multiple hosts in parallel. The technology parses the SQL query to determine the datasets needed to execute the SQL query and aggregates those datasets from the multiple hosts. The technology then creates a temporary database to execute the SQL query and provides the results from the SQL query for display on the user interface.

Abstract: A computer-implemented method for content creation, the method having the steps of: receiving at least one keyword related to said content; creating a first query associated with said at least one keyword; providing said first query to at least one resource to discover information related to said at least one keyword to automatically provide at least one suggestion based on said discovered information to aid said user create content; and whereby said steps are executed in a recursive manner as said content is created.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a query provided by a user and comprising one or more terms. Obtaining context data based on at least a portion of a first resource displayed to the user at a time that the query is received. Obtaining a revised query that is based on the query and the context data. Receiving a plurality of search results responsive to the revised query. Automatically, selecting a search result that represents a second resource from the plurality of search results, and providing the second resource for display to the user.

Abstract: Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T?, and applying local query predicates and projection to L to create L?. Based on determining that a size of L? is less than a size of T? and that the size of L? is less than a first threshold, transmitting L? to the parallel database and executing a join between T? and L?. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T? is less than the size of L? and that the size of T? is less than a second threshold; transmitting T? to the distributed processing system and executing a join between T? and L?.

Abstract: One or more processing devices create one or more entity definitions that each associate an entity with machine data pertaining to that entity and create a service definition for a service provided by one or more entities. The service definition includes an entity definition for each of the one or more entities. The one or more processing devices create one or more key performance indicators (KPIs). Each KPI is defined by a search query that produces a value derived from the machine data identified in one or more of the entity definitions included in the service definition. Each value is indicative of how the service is performing at a point in time or during a period of time.

Abstract: A hybrid approach for performing a join in a database includes: obtaining a distribution of data values in a join column of an inner table; using the distribution, identifying one or more data ranges containing skew; for each data range identified as containing skew, performing, by the processor, the join operation using a skew specific join scheme; and for each data range not identified as containing skew, performing, by the processor, the join operation using a non-skew specific join scheme. One skew specific join scheme involves a compact array table, a highly populated array that represents the range of values that the inner table join column contains. One non-skew specific join scheme involves a compact hash table, an optimized hash table that allows high load factors with a small memory overhead. In combining multiple join techniques, joins may be performed more efficiently for skewed and non-skewed data.

Abstract: A hybrid approach for performing a join in a database includes: obtaining a distribution of data values in a join column of an inner table; using the distribution, identifying one or more data ranges containing skew; for each data range identified as containing skew, performing, by the processor, the join operation using a skew specific join scheme; and for each data range not identified as containing skew, performing, by the processor, the join operation using a non-skew specific join scheme. One skew specific join scheme involves a compact array table, a highly populated array that represents the range of values that the inner table join column contains. One non-skew specific join scheme involves a compact hash table, an optimized hash table that allows high load factors with a small memory overhead. In combining multiple join techniques, joins may be performed more efficiently for skewed and non-skewed data.

Abstract: A log record from a host machine node includes terms. Frequency of occurrence of the terms across a stream of log records is determined. Based on the frequency satisfying a threshold, a Bloom filter vector is selected from among a plurality of Bloom filter vectors based on the frequency, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector. In contrast, based on the frequency of occurrence not satisfying the defined frequency range, a type identifier is identified based on the terms, a Bloom filter vector is selected from among the plurality of Bloom filter vectors based on the type identifier, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector.

Abstract: Techniques for managing configurable data windows for streams and/or archived relations are provided. In some examples, a query that identifies at least a data stream or an archived relation may be identified. Additionally, a configurable window size may be identified. In some instances, the query may be initialized with at least a portion of the historical data based at least in part on the window size. Further, the query may be evaluated based at least in part on the data stream and the portion of the historical data.

Abstract: Methods are disclosed to take advantage of the early collection of machine data from a new or changed entity in a computing environment in order to update the definitional information about entities used by a service monitoring system. In some embodiments, the process undertaken to recognize new or changed entities in an IT environment from collected machine data may be informed by the expertise of a particular subject matter area by installing that intelligence in a codified form packaged as a domain add-on to the service monitoring system.

Abstract: A question relating to an individual is received and context from the question is extracted. Subject matter criteria can be identified from the context of the question. A database containing history data that includes recorded positional data for physical objects relative to the location of the individual at the time of recording can be accessed and relevant physical objects from the history data can be identified based upon the subject matter criteria. A set of answers can be generated for the question from a corpus of data and ranked based upon the identified physical objects and physical distance between the individual and the relevant physical objects.

Abstract: A taxonomy is built by associating metadata with search terms. A body of data records is analyzed to identify pairs of search terms co-occurring in individual data records and to obtain an observed measure of the frequency of such co-occurrences between identified pairs. A taxonomy is then built by constructing metadata and associating the search terms with respective metadata, the metadata for each co-occurring search term identifying at least one other search term with which it co-occurs, together with a measure of relatedness based on the observed co-occurrence frequency measure between the co-occurring pair.

Abstract: The technology disclosed relates to a platform for ultra-fast, ad-hoc data exploration and faceted navigation on integrated, heterogeneous data sets. The disclosed method of declarative specification of visualization queries, display formats and bindings represents queries, widgets and bindings combined on a dashboard in real time, with flexible display options for analyzing data and conveying analysis results.

Abstract: A system, method and graphical user interface (GUI) for creating a new correlation search based on a set of displayed graph lanes. The graph lanes may provide graphical visualizations of key performance indicators (KPIs) associated with one or more services and may assist a user in identifying a situation (e.g., problem or a pattern of interest) in the performance of the services. A user may adjust (e.g., add graph lanes, zooming-in) the graph lanes in order to display the situation, at which point the user may submit a request to create a new correlation search to detect if the situation reoccurs. The system may generate the new correlation search by iterating through the set of graph lanes and analyzing the fluctuations of each KPI to determine triggering criteria. The system may then run the correlation search and generate a notable event or alarm when the situation reoccurs.

Abstract: Techniques are disclosed for providing an aggregate key performance indicator (KPI) that spans multiple services and for receiving user adjustment to KPI factors to configure an aggregate KPI (e.g., heath score). The techniques may enable a user to select KPIs and to adjust weights (e.g., importance) associated with the KPIs. The weight of a KPI may affect the influence a value of the KPI has on the calculation of an aggregate KPI value. The techniques may also include the ability to create a correlation search using the selected KPIs and weights so that a notification may be generated when the aggregate KPI value exceeds a threshold.

Abstract: A service monitoring system receives a selection of key performance indicators (KPIs) that each indicate a different aspect of how a service provided by one or more entities is performing. Each entity of the one or more entities produces machine data or wherein each entity has its operation reflected in machine data not produced by the entity. Each KPI is defined by a different search query that derives one or more values from the machine data pertaining to the one or more entities providing the service, where each of the one or more values is associated with a point in time and representing the aspect of how the service is performing at the associated point in time. For each of the selected KPIs, the service monitoring system derives the one or more values and causes display of a graphical visualization of the derived one or more values for the KPI along a time-based graph lane.

Abstract: A processing device performs a search query to produce a search result set having entries having data items. Each data item has an ordinal position. A table, having rows and columns, is displayed in a graphical user interface. Each data item of a particular entry appears in a respective column of the same row of the table. Each column corresponds to the ordinal position of its respective data item. User input is received designating, for each respective column, a field name and an entity definition component type to which the respective column pertains, and stores for each data item of the particular entry an element value of an entity definition. The element has the element name designated for the respective column in which the data item appeared, and is associated with an entity definition component having the type designated for the respective column in which the data item appeared.

Abstract: A computing machine performs a correlation search against KPI data for one or more services using a selection criteria and a triggering condition. When the triggering condition is satisfied a notable event or incident is created and information about the notable event is presented using a graphical user interface (GUI) that may have interactive elements.

Abstract: A system and method for creating a set of objects correlated with a query. For each element of the set, calculating one of a relevance or a correlation between the element and other elements of the set, constructing an archetype comprising a list of elements of the set for which the relevance or the correlation satisfies a threshold and associating the list of elements with a probability and sorting the list of elements by the probability, wherein the elements having a greater probability are first.

Abstract: In one embodiment, a method includes receiving, from a client system of a user, an indication of the user accessing a query field at the client device of the user, generating a plurality of structured queries that each comprise references to one or more objects associated with the online social network, calculating a score for each structured query based on one or more user-engagement factors, and sending, to the client system responsive to the indication of the user accessing the query field, one or more suggested structured queries for display to the user, each suggested structured query having a score greater than a threshold score.

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a text query inputted by the first user, generating a plurality of structured queries based on the text query, each structured query comprising references to one or more objects associated with the online social network, generating one or more search results corresponding to at least one of the structure queries, and sending, to the client system responsive to receiving the text query, one or more of the structured queries for display, at least one of the structured queries being displayed with a preview of one or more of the search results corresponding to the structured query.

Abstract: A processor-implemented method for accessing data from a data source includes using search-on-the-fly to displaying an initial view of the data source. The initial view includes, as a first data field result list, a dynamically-determined set of first available data fields upon which a data query may be run. The method further includes executing data queries by executing a search-on-the-fly operation. The search-on-the-fly operation includes receiving a first selection of one of the first available data fields and displaying as a first data element result list, a first set of available data elements of the selected first available data field. The method still further includes executing a sort-on-the-fly operation by receiving a sort-on-the-fly command and displaying a second view of the data source. The second view includes as a second data field result list of all data fields from the initial view except the selected first available data field.

Abstract: The apparatus comprises at least one database for storing digital information associated with at least a first user and a second user, at least one links module for the first user and for the second user, at least one manipulations module and at least one display device for respectively displaying at least said linked digital information wherein said linked digital information associated with said first user is automatically updated on at least said display device of said second user when that information is manipulated, and wherein said linked digital information associated with said second user is automatically updated on at least said display device of said first user when that information is manipulated.

Abstract: The Database, Data Structure and Framework Transformer Apparatuses, Methods and Systems (“DDSFT”) transforms variable list request, population selection, base table transform extract data inputs via DDSFT components into transformed, merged data outputs. The DDSFT includes a database structure that stores data used in the framework operations. A macro-tool includes one or more macros that control a sequence of database queries that extract the data from the database structure and then perform transformations on the extracted data. The macro-tool includes a series of binary flags indicative of whether or not statements are executed.

Abstract: Dataflow optimization is described for extractions from a data depository. In one example an object-relationship graph of a data extraction definition is traversed in a first pass. The object-relationship graph has a node for each object. The steps from each node of the graph in the first pass is determined. It is determined if any of the determined steps are repeated. A single instance of each repeated step is placed before other steps in a query plan. Data is then extracted in a second pass from the object-oriented database system according to the object-relationship graph by performing the repeated steps first and then reusing the repeated steps in other determined steps.

Abstract: Navigation of a data extraction graph is described. The data extraction graph may be a graph representation of data and metadata in an object-oriented database. In one example, a data extraction definition of metadata from a database system is presented in a graph format. The graph format is transformed into a linear object tree, and/or an object list. Navigation commands are received from a user to navigate the transformed graph format. Selections of objects are received from the user to select objects in the transformed graph format. A summary view of the selected objects is then provided in the transformed graph format.

Abstract: Various computer implemented methods and data processing apparatus are described for use in structuring digital items and searching a plurality of digital items using a query item. At least one feature of a query digital item is extracted from a data file of the query digital item to form a query feature vector from a plurality of numerical data items representing the feature. It is determined which of a plurality of first clusters is most similar to the query digital item to identify a result cluster from the plurality of first clusters by calculating the aggregated similarity of a plurality of different digital items represented by a one of the first clusters to the query digital item for each of the plurality of first clusters using the query feature vector. Each of the plurality of first clusters represents a different plurality of digital items and each digital item is represented by only one of the plurality of first clusters.

Abstract: Systems and methods are disclosed for providing distributed learning over a plurality of parallel machine network nodes by allocating a per-sender receive queue at every machine network node and performing distributed in-memory training; and training each unit replica and maintaining multiple copies of the unit replica being trained, wherein all unit replicas train, receive unit updates and merge in parallel in a peer-to-peer fashion, wherein each receiving machine network node merges updates at later point in time without interruption and wherein the propagating and synchronizing unit replica updates are lockless and asynchronous.

Abstract: A raw dataset including measures and dimensions is processed, by a preprocessing module, using an algorithm that produces a preprocessed dataset such that at least one type of statistical analysis of the preprocessed dataset yields equal results to the same type of statistical analysis of the raw dataset. The preprocessed dataset is then analyzed by a statistical analysis module to identify subsets of the preprocessed dataset that include a non-random structure or pattern. The analysis of the preprocessed dataset includes the at least one type of statistical analysis that produces the same results for both the preprocessed and raw datasets. The identified subsets are then ranked by a statistical ranker based on the analysis of the preprocessed dataset and a subset is selected for visualization based on the rankings A visualization module then generates a visualization of the selected identified subset that highlights a non-random structure of the selected subset.

Abstract: This disclosure in part describes systems, devices, and methods for implementing a unification mechanism that enables the unification of various data sets, which can permit greater collaboration between users of a data management platform. For example, a system can be configured to enable a user to add or associate a contextual object with a data measure. In associating the contextual object with the data measure, the system can store the contextual object with a parameter indicative of the unique dimension coordinates that are associated with the data measure. Other users of the system may, in turn, access the data measure and be shown the contextual object associated with the data measure.

Abstract: A method for using analytics to define and deliver wrap packages of cards with insight content. The method includes the steps of generating insight content by applying analytics to a set of data, inserting or associating the insight content into one or more content component container(s) included in a set of cards of a wrap package, and generating a wrap descriptor for the wrap package.

Abstract: There is provided an information processing device including a display control unit configured to display pieces of content at a first position of a screen, a condition setting unit configured to set a clustering condition for the pieces of content in accordance with a user operation, and a clustering unit configured to classify the pieces of content into a cluster in accordance with the clustering condition. The display control unit moves a display of the pieces of content from the first position toward a second position corresponding to the cluster.

Abstract: Embodiments described herein are directed to providing local search engines over large databases. In one scenario, a computing system receives as inputs data records stored in a database. The computing parses the data records into file pairs that each include a keyword file and record ID file and merges file pairs into a keyword file and record ID file, where the keyword file includes keywords in sorted order, and where the record ID file includes a list of record IDs for keywords in the keyword file. The computing system further creates an offset file which stores offset values for starting addresses of record ID lists in the record ID file, and generates an index of keywords by assigning unique identifiers to keywords in the keyword file. The computing system also provides a query interface that allows the database's data records to be searched using the generated index of keywords.

Abstract: One or more processing devices derive a value for each of a plurality of key performance indicators (KPIs). Each KPI indicates a different aspect of how the same service provided by one or more entities is performing at a point in time. Each KPI is defined by a search query that derives the value for that KPI from machine data associated with the one or more entities that provide the same service. The one or more processing devices calculate a value for an aggregate KPI for the same service from the values for each of the plurality of KPIs.

Abstract: Technologies are disclosed for providing a common information model. Features include: detecting a scheduled time for a key performance indicator reflecting how a service provided by one or more entities is performing, entity definition information recording the association between the entities and its machine data, service definition information associating the entities that provide the service, and the KPI being defined by a search query, including a field identifier specified in a data model, the KPI derives a value from the machine data; performing the query in response to said detecting, including: associating values in the machine data having disparate field names in accordance with disparate schemas with the field identifier specified in the data model, and processing the associated values as semantically equivalent data instances. In doing so, values having the same semantic (or related semantics) can be used together despite being associated with disparate field names from disparate schemas.

Abstract: One or more processing devices access a service definition for a service provided by one or more entities that each produce machine data or about which machine data is generated. The service definition identifies the entities that provide the service and, for each entity, identifying information for locating machine data pertaining to that entity. The processing devices access a key performance indicator (KPI) for the service that is defined by a search query that produces a value derived from the machine data pertaining to the entities identified in the service definition. The value indicates how the service is performing at a point in time or during a period of time and indicates a state of the KPI. A graphical interface is displayed and an indication of at least one threshold, which defines an end of a range of values representing a state of the KPI, for the KPI is received.

Abstract: Disclosed embodiments include apparatuses, methods and storage media associated with food item categorization. In embodiments, an apparatus may include one or more processors and a food categorization engine. The food categorization engine may be operated by the one or more processors to cause the apparatus to receive a description of a food item; analyze the description of the food item; and select one or more food categories with which to associate the food item based at least in part on a result of the analysis. Other embodiments may be described and claimed.

Abstract: Systems and methods for exchanging a data stream of information that varies over time using a message format. The message format includes a version field that indicates a version of a structure of the message format. The message format also includes one or more resources fields that each identifies a resource to be imported into the data stream exchanging the data stream. Moreover, the message format includes one or more records that represent time-variant data samples being exchanged in the message. Furthermore, the message format includes one or more descriptor fields, wherein each descriptor field corresponds to at least one respective record of the one or more records and contains metadata describing data contained within the at least one record.

Abstract: Methods and apparatus are provided for representing structured information. A computing device can receive data from data sources. The computing device can generate a data frame that includes data items based on the received data. The computing device can determine a data ontology, where the data ontology can include datanodes. The computing device can determine data pins which include a first data pin. The first data pin can include a first reference and a second reference. The first reference can refer to a first data item in the data frame and the second reference can refer to a first datanode of the plurality of datanodes. The first datanode can be related to the first data item. The computing device can obtain data for the first data item at the first datanode via the first data pin and then can provide a representation of the data ontology.

Abstract: A method for calculating linkage for a plurality of webpages (20) of a domain of a website (10) is disclosed. The method comprises accessing (400) at least one link table (45) in a non-transitory data system (50), the at least one link table (45) has a plurality of linkage data entries of the plurality of webpages (20), wherein the linkage data entries comprise at least one of internal links, external links or orphan links. The method further comprises extracting (410) a subset of the plurality of linkage data entries, analyzing (415) the extracted subset of the plurality of linkage data entries, and calculating (415) a type or a degree of linkage for the plurality of webpages (20) linked by the extracted subset of the plurality of linkage data entries. The linkage can be presented in the form of a directed graph on a display.

Abstract: Aggressive exploration can involve multiple, successive queries and visualizations. This creates difficulty scaling the resources needed to deliver fast responses. It is particularly complicated by regular rebuilding of analytic data stores, whether daily or on demand. Migrating queries using the technology described involves migrating indexed fields, known as dimensions, and quantity fields, known as measures, in the background during a query session. A session that starts in server query processing mode may switch to client query processing as enough data fields have been copied from the server to the client. When the client determines that it has enough data fields to process an incoming query, it can locally process the new query without passing it to the server. Since both the server and client are working from copies of the same read only analytic data structure, a user receives the same results from either client or the server.

Abstract: A method, performed by an electronic device, for linking a thumbnail of an image and at least one web page is disclosed. In this method, the image including at least one text region may be accessed in a storage unit. At least one text region may be detected in the image and at least one character string in the at least one text region may be recognized. Further, the method may include selecting the at least one web page from the plurality of web pages and linking the thumbnail of the image and the at least one web page.