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: 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: A IO handler receives a write command including write data that is associated with a LBA. The IO handler reserves a deduplication ID according to the LBA with which the write data is associated, within the scope of each LBA, each deduplication ID is unique. The IO handler computes a hash value for the write data. In case a deduplication database does not include an entry which is associated with the hash value, the IO handler: provides a reference key which is a combination of the LBA and the deduplication ID; adds to the deduplication database an entry which is uniquely associated with the hash value and references the reference key; and adds to a virtual address database an entry, including: the reference key; a reference indicator indicating if there is an entry that is associated with the present entry; and a pointer to where the write data is stored.

Abstract: The method includes generating, by one or more computer processors, a first piece of data based on a defined set of data characteristics. The method further includes generating a first bit, wherein the first bit corresponds to the first generated piece of data. The method further includes sending the first generated piece of data to a target location. The method further includes receiving the first generated piece of data from the target location. The method further includes determining whether to validate the first generated piece of data received from the target location. The method further includes adjusting the first generated bit based on the determination of whether to validate the first generated piece of data.

Abstract: A mechanism is provided to implement an action for an intended selection of content element due to dynamically shifting content. For a set of content elements displayed in a user interface, changes to locations of the set of content elements and a set of user interactions with the set of content elements are analyzed. A determination is made as to whether a loading of a dynamic content element will cause a user's intended selection of the content element within the set of content elements to be erroneously performed. Responsive to determining that the loading of the dynamic content element will cause the user's intended selection of the content element to be erroneously performed, the action for the intended selection of the content element that takes into account the loading of the dynamic content element is implemented.

Abstract: In embodiments, method and systems are provided for facilitating identification of field values based on delimiters. In some implementations, a user selection of a delimiter type to use for identifying values within fields is received. The values within fields are generally separated from one another by delimiters. A first set of one or more values from a plurality of events based on the selected delimiter is identified. Further, a second set of one or more values from the plurality of events is identified based on the selected delimiter. The identified first set of one or more values to a first field and the second set of one or more values to a second field. Additional embodiments are described and/or claimed.

Abstract: A modular visualization framework registers definitions for a variety of visualization types. The definitions are tagged with visualization characteristics. During a working session, likely interactive, a user identifies a search query used to produce data to be visualized. The working context, including the search query and data produced by its execution, is tagged for its visualization characteristics. Information about the working context, including its visualization characteristics, is then used to produce a customized list of candidates suited for the working context from which the user may select a visualization type.

Abstract: A method includes accessing, in response to initiating an operation targeting data, auxiliary mapping data to determine whether the auxiliary mapping data includes an indication of a key associated with a node of a hierarchical data structure that is associated with the data. In response to the auxiliary mapping data including the indication of the key, the data is accessed from a memory using a node identification associated with the key. In response to the auxiliary mapping data not including the indication of the key, the data is accessed from the memory using a search operation.

Abstract: A method, system and computer program product for processing hierarchical data is provided. A method for processing hierarchical data in a relational database includes receiving an input parameter in an initial query for querying an array in a hierarchical data object stored in a table of a relational database, and transforming the initial query into a transformed query configured to place all elements of the array into a different table and to apply a sub-query against the table for the input parameter. Once transformed, predicate evaluation logic of a relational engine of the relational database is applied to the transformed query that is then mapped to the initial query. Finally, responsive to receiving a subsequent instance of the initial query, the mapping is referred to in order to replace the initial query with the transformed query and to subsequently apply the predicate evaluation logic to the transformed query.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: An information handling system includes a memory to store combined behavioral data and interactional data associated with search queries, and a processing device. The processing device communicates with the memory. The processing device receives a first search query including first search terms, and user context associated with the first search query, retrieves the combined behavioral data and interactional data from previous search queries, analyzes the first search terms using the combined behavioral data and interactional data, generates signals based on the first search terms, the user context, and the combined behavioral data and interactional data, and provides the signals for use in altering results to be provided in response to the first search query.

Abstract: An information handling system includes a memory to store a first search query including first search terms, and user context associated with the first search query. The processing device communicates with the memory. The processing device generates a first probabilistic strategy for the first search query based on the signals and a first result strategy. The first probabilistic strategy indicates a probability that the search query is directed to the first result strategy. The processing device also creates an overall strategy for the search query based on the first probabilistic strategy, and provides the overall strategy for use in altering results to be provided in response to the first search query.

Abstract: Systems and a method are provided. A system includes a Temporal Behavior Query Language (TBQL) server having a processor and a memory operably coupled to the processor. The TBQL server configured to construct a TBQL query using a grammar inference technique based on syntactic sugar to expedite query construction. The TBQL server is further configured to execute the TBQL query to generate TBQL query results.

Abstract: Methods comprising loading a data model in-memory, providing a first graphical object of loaded data based on the data model, wherein the first graphical object represents a plurality of data sets, executing a first procedure in an inference engine based on a user selection in the plurality of data sets to generate a data subset, executing a second procedure in a calculation engine to generate a first multidimensional data cube based on the data subset to generate a second graphical object, providing at least a portion of the data subset to an external engine to perform a third procedure, receiving a result of the third procedure from the external engine, repeating the first procedure and the second procedure based on the data subset and the result of the third procedure to generate a second multidimensional data cube and to generate a third graphical object, and providing the third graphical object.

Abstract: Methods, systems, computer program products, and articles of manufacture for performing a query are described. Context information for formulating a query is obtained. The query is performed to identify a first card based on the context information, the query being performed by comparing the context information and an attribute of the first card, the attribute defining context of the first card. The identification of the first card that satisfies the query is provided.

Abstract: A method for referencing and updating objects in a shared resource environment. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache. When the object type needs to be updated, it is cloned into a local cache, and changes are made on the local copy. The global cache is then locked to all other users, the original object type is detached, and the cloned object type is swapped into the global cache, after which the global cache in unlocked.

Abstract: Representative embodiments are disclosed for a rapid and highly parallel decompression of compressed executable and other files, such as executable files for operating systems and applications, having compressed blocks including run length encoded (“RLE”) data having data-dependent references. An exemplary embodiment includes a plurality of processors or processor cores to identify a start or end of each compressed block; to partially decompress, in parallel, a selected compressed block into independent data, dependent (RLE) data, and linked dependent (RLE) data; to sequence the independent data, dependent (RLE) data, and linked dependent (RLE) data from a plurality of partial decompressions of a plurality of compressed blocks, to obtain data specified by the dependent (RLE) data and linked dependent (RLE) data, and to insert the obtained data into a corresponding location in an uncompressed file.

Abstract: A method of discovering media assets across a content repository is disclosed. Information of interest is gathered from activity on a social media site. The information of interest is analyzed to determine a selected topic. The content repository is searched for media assets related to the selected topic. The selected topic is aggregated with links to the media assets related to the selected topic from the content repository.

Abstract: An information handling system includes a memory to results for different search queries. The processing device communicates with the memory. The processing device generates signals for the first search query based on the first search terms, the user context, and behavioral data and interactional data from previous search queries, generates an overall result strategy for the search query based on the signals, determines a first set of results for the search query in response to a first probability that the first search query is directed to a first result strategy in the overall result strategy. The first set of results is a subset of a second set of results available for the first search query. The processing device also generates final results based on the first set of results, and to provide the final results as a response to the first search query.

Abstract: In a first aspect, a method includes, at a node of a Hadoop cluster, the node storing a first portion of data in HDFS data storage, executing a first instance of a data processing engine capable of receiving data from a data source external to the Hadoop cluster, receiving a computer-executable program by the data processing engine, executing at least part of the program by the first instance of the data processing engine, receiving, by the data processing engine, a second portion of data from the external data source, storing the second portion of data other than in HDFS storage, and performing, by the data processing engine, a data processing operation identified by the program using at least the first portion of data and the second portion of data.

Abstract: Disclosed are pluggable, distributed computing-system architectures allowing for embedding analytics to be added or removed from nodes of a system hosting an in-memory database. The disclosed system includes an API that may be used to create customized, application specific analytics modules. The newly created analytics modules may be easily plugged into the in-memory database. Each user query submitted to the in-memory database may specify different analytics be applied with differing parameters. All analytics modules operate on the in-memory image of the data, inside the in-memory database platform. All the analytics modules, may be capable of performing on-the-fly analytics, which may allow a dynamic and comprehensive processing of search results.

Abstract: A method for managing device replacements is disclosed. The method proposes to data mine a dataset of device transitions, wherein a device transition is an entry representing a user replacing a first device by a second device at a given point in time. This dataset is exploited so as to first predict which device, or set of devices is closed to be obsolete and needs to be replaced and then, to determine a candidate new device that is the most suited to replace the obsolete device.

Abstract: Systems, methods, and computer-readable storage media are provided that perform a search request against a queue database of customers in a queue for access to a resource.

Abstract: A patent searching method in connection to a matching degree, wherein the patent searching method is applied in a patent searching system to search a patent specification having a plurality of patent sections including abstract, description, and claims, in a patent database, the patent searching method comprising: a keyword designating step of receiving a designated keyword including at least one component keyword so as to determine a searching condition, and a search determining step of determining a matching degree of the patent specification in connection to the designated keyword, wherein there are a plurality of derived patent specifications, and the matching degree of each derived patent specification in connection to the designated keyword is assigned a searching weighted result value obtained by adding up at least one searching weighted value which is assigned to all component keywords belonging to the designated keyword.

Abstract: Techniques and mechanisms are disclosed to optimize the size of index files to improve use of storage space available to indexers and other components of a data intake and query system. Index files of a data intake and query system may include, among other data, a keyword portion containing mappings between keywords and location references to event data containing the keywords. Optimizing an amount of storage space used by index files may include removing, modifying and/or recreating various components of index files in response to detecting one or more storage conditions related to the event data indexed by the index files. The optimization of index files generally may attempt to manage a tradeoff between an efficiency with which search requests can be processed using the index files and an amount of storage space occupied by the index files.

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a request associated with a particular content item; identifying communications authored by one or more users, each identified communication being associated with the particular content item; generating one or more search-results modules related to the particular content item, each search-results module being of a particular module type, wherein each search-results module includes information from a subset of the identified communications, the information corresponding to the particular module type of the search-results module, and wherein a number of communications in the subset of the identified communications including each search-results module is greater than a module-specific threshold number of communications; and sending, to the client system, a search-results interface comprising one or more of the search-results modules.

Abstract: Methods and systems for improving user search experience with a search engine by providing a way for associated users to create and share personalized lists of local search results and/or advertisements through endorsements of such local search results and/or ads. Local search endorsements can be used to personalize the search engine's ranking of local search results by offering a way for users to re-rank the results for themselves and for those who trust them.

Abstract: A method and device for automatically generating Extract Transform Load (ETL) codes includes a code generation device that automatically detects one or more ETL patterns based on the received predefined ETL codes. The code generation device scans pattern database which comprises one or more ETL patterns to determine the presence of the one or more detected ETL patterns. Upon selecting the detected one or more ETL patterns by the user, the code generation device retrieves the selected one or more ETL patterns from the pattern database. User inputs are received for each of the one or more ETL patterns retrieved from the pattern database. The code generation device automatically identifies one or more ETL mappings from the primary data source to the secondary data source for each of the one or more ETL patterns and automatically generates ETL codes based on the one or more ETL mappings.

Abstract: Various methods and apparatuses are described for performing high speed format translations of incoming data, where the incoming data is arranged in a delimited data format. As an example, the data in the delimited data format can be translated to a fixed field format using pipelined operations. A reconfigurable logic device can be used in exemplary embodiments as a platform for the format translation.

Abstract: A method and apparatus for accessing information stored in a key value database. The method comprises receives, by a computer system, a request from a client device to access the information in the key value database in a storage system for the computer system. Further, the method comprises identifies, by the computer system, a structure for the information from the request. Yet further, the method comprises creates, by the computer system, a relational database having the structure identified from the request. Further, the method comprises places, by the computer system, the information for the client device in the relational database, wherein the relational database is located in a memory, wherein the relational database in the memory is accessed by the client device, enabling access to the information in the key value database by client devices that access relational databases with different relational database structures.

Abstract: The invention relates to a method, an apparatus and a computer program product. The method comprises managing data in one or more data repositories by a centralized content management system comprising at least one server, wherein said one or more data repositories are connected to said centralized content management system, and at least one of said one or more data repositories resides on a device that is other than a server of the centralized content management system, wherein the method further comprises receiving by a server of the centralized content management system a request from a mobile client device to access data in a data repository connected to the centralized content management system; and providing the mobile client device with an access to the data repository by the centralized content management system.

Abstract: An Application Program Interface (API) manages synchronization and replication of master data of a system with different consumers. An API engine is configured to receive from the third party, a query including content information and date-relevant information including a start date, an end date, and a date of last synchronization. The API engine processes the query to access the database and produce a query result replicating only data changes affecting that period or a previous time. The consumer thus specifies the time period in which to consider changes to the stored database data, and the API calculates the delta according to that period. In this manner complex, time-dependent delta calculation and filtering logic can be implemented in the API without requiring substantial logic or additional data persistence in middleware. Particular embodiments may facilitate efficient synchronized replication of employment data to outside (e.g., payroll, benefits) providers.

Abstract: A method and apparatus of a device that updates a key range in a database for a writer of a network element that replicates changes to the database to a plurality of readers. In an exemplary embodiment, the device receives a key deletion notification for a key, where the key deletion notification is a notification to delete a key from the database and the database stores data used by the network element. The device further locates the key in an ordered data structure, the ordered data structure stores a plurality of keys in an ordered fashion. The device additionally deletes the in the ordered data structure and determines an upper and lower bound key for the deleted key. In addition, the device creates an empty key range from the upper and lower bound keys and creates an empty key range notification from the empty key range.

Abstract: A cluster management system and method for synchronizing content libraries within a distributed computer system uses multiple replication processes to synchronize a subscribed content library with a publishing content library, which includes at least a consumable software item and metadata of the consumable software item. If the consumable software item of the publishing content library can be replicated at the subscribed content library using a first data replication process, then the consumable software item of the publishing content library is replicated at the subscribed content library using the first data replication process. If the consumable software item of the publishing content library cannot be replicated at the subscribed content library using the first data replication process, the consumable software item of the publishing content library is replicated at the subscribed content library using a second data replication process.

Abstract: A cluster management system and method for synchronizing content libraries within a distributed computer system allows an on-demand synchronization option of a content library subscribed to a publishing content library, which includes at least a consumable software item and metadata of the consumable software item, to be enabled. As a result of the on-demand synchronization option of the subscribed content library being enabled, the metadata of the consumable software item is downloaded from the publishing content library to the subscribed content library without downloading the consumable software item. The consumable software item is downloaded from the publishing content library to the subscribed content library in response to user selection of the consumable software item at the subscribed content library.

Abstract: Several different embodiments of a massively scalable object storage system are described. The object storage system is particularly useful for storage in a cloud computing installation whereby shared servers provide resources, software, and data to computers and other devices on demand. In several embodiments, the object storage system includes a ring implementation used to associate object storage commands with particular physical servers such that certain guarantees of consistency, availability, and performance can be met. In other embodiments, the object storage system includes a synchronization protocol used to order operations across a distributed system. In a third set of embodiments, the object storage system includes a metadata management system. In a fourth set of embodiments, the object storage system uses a structured information synchronization system. Features from each set of embodiments can be used to improve the performance and scalability of a cloud computing object storage system.

Abstract: Clusters of log lines are identified based on log line templates. The log line templates are based on a punctuality pattern for a log line. Clusters of log lines that match each punctuality pattern can be identified based on comparisons between the log lines. The comparison may determine the similarity of the log lines and ultimately identify whether the log lines are close enough to be clustered. The comparison may be based on generated n-grams for the log lines and performing a hash on the n-grams. The resulting cluster information may be communicated to a user in an interface.

Abstract: In one embodiment, a method includes executing a first logging process, a second logging process and a categorization process in parallel on a computer system, wherein the first logging process identifies computer-performance events at a monitored resource. The method further includes the second logging process monitoring the first logging process for the computer-performance events. The method also includes, as particular computer-performance events at the monitored resource are detected, the second logging process recording the particular computer-performance events in a data store. The method additionally includes the categorization process parsing log entries of the second log. Further, the method includes the categorization process dynamically determining processing rules that are applicable to the parsed log entries. Also, the method includes the categorization process categorizing the parsed log entries using the dynamically determined processing rules.

Abstract: The present disclosure, in some embodiments, describes a system for classifying members of a collection of texts into clusters to generate merged data collections. A member text can range from a single document to the contents of a column in a database table. The classification may indicate and/or provide an estimation as to which documents or columns are most closely similar to each other, without making any assertion about the actual contents of the document or column. In some embodiments, a system may include counting some characteristic of the text. The characteristic may be chosen such that each text produces a set of counts. A statistical measure is then applied to determine the similarity of sets of counts associated with each pair of texts.

Abstract: Classifying an electronic document in a computer-based system is disclosed. For each classification instance in a plurality of classification instances, a confidence data indicating a degree of confidence that the electronic document is associated with that classification instance is determined. A classification, based on a first classification instance in the plurality of classification instances, is assigned without human intervention to the electronic document if the confidence data associated with the first classification instance exceeds a first threshold.

Abstract: A cluster system includes an interface and a processor. The interface is to receive a request from a user associated with one of a plurality of shells. The processor is to determine a plurality of tasks to respond to the request; determine a local set of data and a shared set of data for a task of the plurality of tasks, wherein the local set of data is associated with the one of the plurality of shells; and provide the task, a local set indication, and a shared set indication to a worker associated with the task, wherein the local set indication refers to the local set of data and the shared set indication refers to the shared set of data.

Abstract: A method for dynamic event detection based on content from a set of social networking systems including receiving content from the set of social networking systems, identifying a plurality of content associated with a geofence, the content that was generated within a predetermined time period, determining feature values from the plurality of content for each of a set of features, determining an event probability for the geofence based on the feature values, and detecting an event within the geofence in response to the event probability exceeding a threshold event probability.

Abstract: Current disclosure discloses a method and device for determining a category directory, and an automatic classification method and device. A user change category message is received. A target change category item is generated based on the user change category message. Previous change category items are analyzed with respect to the target change category item to determine whether an existing category directory needs to be updated.

Abstract: Apparatuses, systems, methods, and computer program products are disclosed for data supplementation and verification. A method includes determining that an identifier within aggregated data is not a previously classified known identifier. A method includes transmitting an identifier to a search interface of a server of a third party service provider. A method includes receiving results associated with an identifier from a third party service provider. A method includes parsing results to determine whether a plurality of results have a common pattern associated with a classification. A method includes, in response to determining that a plurality of results have a common pattern associated with a classification, associating the classification with an identifier based on the common pattern.

Abstract: The disclosure discloses a method of collecting user feedback of webpages, including: receiving instructions of feedback operations on a current webpage; loading and displaying, based on the received instructions, a feedback webpage associated with the current webpage; receiving feedback input from a user regarding elements requiring feedback on the feedback webpage; generating a feedback collection interface based on the elements requiring feedback and the feedback input; and receiving the user feedback via the feedback collection interface, and collecting on-site information while receiving the user feedback. The method of collecting user feedback of webpages has low requirements for users, is convenient and simple to operate, and is highly targeted. The disclosure additionally provides a method for processing user feedback on webpages, simplifying the processing flow of user feedback and achieving higher efficiency in processing user feedback.

Abstract: Embodiments of the present invention are directed to facilitating enhancement of time series prediction. In accordance with aspects of the present disclosure, a set of time series data is determined to have at least one missing data value. Based on the missing data value(s), a predicted missing value is generated for each of the at least one missing data values. The predicted missing value for a missing data value is generated, for example, based on a weighted average of a time series data value preceding the missing data value and a time series data value following the missing data value. The set of time series data and the predicted missing values for each of the at least one missing data values can then be used to determine periodicity associated with the set of time series data.

Abstract: Various technologies described herein pertain to executing a mixed query to search a database retained in a data repository. The mixed query includes a regular expression, which is a pattern of elements, and a semantic constraint. The elements in the regular expression include a first wildcard, where the semantic constraint restricts a meaning of the first wildcard. Moreover, the elements in the regular expression include explicit lexical constraint(s) and/or disparate wildcard(s). For instance, semantic constraint(s) can restrict meaning(s) of the disparate wildcard(s). The mixed query is executed to retrieve results that match the pattern of the elements in the regular expression and satisfy the semantic constraint(s).

Abstract: Systems and techniques for determining significance between entities are disclosed. The systems and techniques identify a first entity having an association with a second entity, apply a plurality of association criteria to the association, weight each of the criteria based on defined weight values, and compute a significance score for the first entity with respect to the second entity based on a sum of a plurality of weighted criteria values. The systems and techniques utilize information from disparate sources to create a uniquely powerful signal. The systems and techniques can be used to identify the significance of relationships (e.g., associations) among various entities including, but not limited to, organizations, people, products, industries, geographies, commodities, financial indicators, economic indicators, events, topics, subject codes, unique identifiers, social tags, industry terms, general term/s, metadata elements, classification codes, and combinations thereof.

Abstract: An aspect of topic generation includes parsing communications conducted by users through an application. The communications include a communication generated by a sender and response communications received from recipients in reply to the communication generated by the sender. An aspect also includes identifying keywords, timestamps, and indications of sentiment from the parsed communications through natural language processing, determining a focus of the communication generated by the sender based on the keywords identified from the parsing, and formulating a topic for a publication based on criteria including a frequency of occurrence of the keywords in the parsed communications, a threshold level of the indications of sentiment that appear in the parsed communications, and/or a number of the communications containing one or more of the keywords having corresponding timestamps that fall within a threshold period of time. An aspect further includes submitting the topic for publication to the sender.

Abstract: Disclosed are a method of providing search results and a system for performing the method. A search result providing method may include generating a preferred collection list associated with a keyword using one or more selected collections; and sorting and providing search results about the keyword in the preferred collection list.