Abstract: A method, system and computer program product for index maintenance in a computer system comprising a plurality of nodes, a database, and an index to the database. In one embodiment, the method comprises, for a defined period of time, building a snapshot of selected change requests received by the nodes to change the database. After this defined period of time, a selection is made, based on specified criteria, whether to rebuild a new index to the database, or to add entries to a current index. When the selection is to rebuild a new index, the new index is rebuilt based on data in the database and in the change requests in the snapshot. When the selection is to add entries to a current index, entries are added to the current index based on data in the database and in the change requests in the snapshot.

Abstract: In searching an index in an original search structure for a database, portion(s) of the index are determined to be stored in a memory in an alternate search structure. The alternate search structure with the portion(s) is created and stored in the memory. The index is searched by traversing the alternate search structure and possibly the original search structure. The alternate search structure may be traversed more efficiently than the original search structure. The number of portions of the index may be a tunable parameter or selected based on a performance improvement/expense ratio. The search of the index begins at the alternate search structure. During traversal of the one or more portions in the alternate search structure, if traversal is to continue at a portion in the original search structure, the identity of this portion is obtained. The traversal is continued at this identified portion in the original search structure.

Abstract: In searching an index in an original search structure for a database, portion(s) of the index are determined to be stored in a memory in an alternate search structure. The alternate search structure with the portion(s) is created and stored in the memory. The index is searched by traversing the alternate search structure and possibly the original search structure. The alternate search structure may be traversed more efficiently than the original search structure. The number of portions of the index may be a tunable parameter or selected based on a performance improvement/expense ratio. The search of the index begins at the alternate search structure. During traversal of the one or more portions in the alternate search structure, if traversal is to continue at a portion in the original search structure, the identity of this portion is obtained. The traversal is continued at this identified portion in the original search structure.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is stored as discrete events time stamps. A search is received and relevant event information is retrieved based in whole or in part on the time stamp, a keyword indexing mechanism, or statistical indices calculated at the time of the search.

Abstract: Partition management for a scalable, structured storage system is provided. The storage system provides storage represented by one or more tables, each of which includes rows that represent data entities. A table is partitioned into a number of partitions, each partition including a contiguous range of rows. The partitions are served by table servers and managed by a table master. Load distribution information for the table servers and partitions is tracked, and the table master determines to split and/or merge partitions based on the load distribution information.

Abstract: A hosted service may limit access to a table initially comprising one or more partitions. Access to the table may be limited to a provisioned capacity. A client of the service may request an increased capacity. A minimum number of partitions for providing the increased capacity may be determined. Proportions of the increased capacity may be allocated among members of successive generations of partitions to be provided by a member of a generation or its descendants. The proportions may be allocated to minimize the costs associated with splitting partitions based on the minimum number of partitions.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: A messaging system automatically populates a stream of messages using only a seed selected by the requesting account holder. In one embodiment, the seed includes the streams of one or more of the “top” accounts of the messaging system. Here, “top” is according to any one of a number of different metrics stored in the messaging system. With knowledge of the seed, the messaging system automatically populates a stream for the requesting account holder, without requiring any other input. As a result, an account holder is provided with a fully functioning stream with very little effort or knowledge required on their part.

Abstract: A method, computer program product, and computer system for updating progression of performing computer system management. A computer system receives a log-on of a change implementer onto a managed computer system and searches a change request on a managing computer system. In response to that the change request is found, the computer system receives from the change implementer a command with a current date and time and matches the command to one or more tasks within the change request. In response to determining that the command matches the one or more tasks, the computer system updates start dates and times of the one or more tasks. And, in response to that the one or more tasks are completed, the computer system updates stop dates and times of the one or more tasks.

Abstract: In an embodiment, a method includes accessing a call tree for a transaction, wherein the call tree traces routines called during execution of the transaction. The method further includes generating a graphical representation of the call tree in relation to two or more performance properties. In addition, the method includes causing the graphical representation of the call tree to be displayed. Further, the method includes allowing a user to graphically select a group of routines from the graphical representation of the call tree. In addition, the method includes creating a filtered call tree comprising the graphically selected group of routines. Furthermore, the method includes generating a drill-down visualization of the filtered call tree. The method also includes causing the drill-down visualization to be displayed.

Abstract: An identical request to process a transaction is initiated at multiple nodes or multiple applications, and the results are committed. Subsequent to the commit, indicia regarding the outcome of the processing are compared, and the transaction is rolled back if the comparison indicates that the processing was incorrect.

Abstract: Systems and methods are described to quickly search a data store based on one or more n-dimensional colors. The n-dimensional colors in the data store may be converted to interleaved integers and indexed. An n-dimensional color search range may be converted to one or more integer search ranges. A fast color search query may be formulated based on the one or more integer search ranges, and transmitted to the data store for searching. The data store may use the interleaved integer index to quickly compare the integer search ranges to the interleaved integers, and send back one or more colors or object results that matched the desired color range.

Abstract: A system, method, and computer-readable medium for the calculation of execution time estimates of user defined functions/user defined methods are provided. The execution of a UDF or UDM is timed several times at the time of the UDF/UDM creation, and an average execution time of the UDF/UDM is obtained. The resulting average execution time is then stored in a data dictionary where the optimizer may consult this value to factor it into the cost of execution of a 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: Tuning a production database system through the use of a remote mimic. In response to receipt of a query tuning request against a database system, information about that system is obtained and a mimic of the system is set up in a remote system environment. The mimic aims to imitate the database system in all relevant ways with respect to the tuning request. A tuning analysis is then performed on this mimic system such that there is substantially no impact to operations of the original database system. Tuning results are then applied to the original database system. The entire process takes place with little or no human intervention.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing differential recursive evaluation of recursive aggregates. One of the methods includes receiving an original recursive expression that defines tuples belonging to an output relation, wherein the original recursive expression has a recursive aggregation construct, the recursive aggregation construct having a range and a recursive term. An aggregates delta rule is applied to the initial delta expression to generate a final delta expression having an existential term and a gamma term. The existential term is evaluated to generate tuples related by the range and tuples in the delta relation, and the aggregation construct is evaluated using tuples generated by the existential term as the range of the aggregation construct. The output relation is updated including adding to the output relation any tuples newly generated by evaluating the final delta expression.

Abstract: A database system supporting persistent queries, comprising a persistent query service that receives connections and requests from client software applications; and a plurality of network-attached data sources; and a method for providing persistent queries using a persistent query service.

Abstract: A stream of tuples are processed by a plurality of processing elements, each including one or more stream operators, operating on computer processors. A method determines whether a first stream operator includes a first operation that is deterministic and whether a second stream operator includes a second operation that is equivalent to the first operation. In response to determining that the first operation is deterministic and the second operation is equivalent to the first operation, the first stream operator is configured to include in a tuple output from the first stream operator a result of performing the first operation using a first input. The second stream operator, which uses a second input when performing the second operation, determines whether the second input is the same as the first input, and uses the result in lieu of performing the second operation when the first and second inputs are the same.

Abstract: The present disclosure relates to the searching technology field, and discloses a method and a device for searching a contact object, and a storage medium. The method comprises: normalizing a content of a contact field; receiving an input string for contact object searching, wherein the input string comprises any character or a combination of characters; normalizing the input string; searching in the normalized content of the contact field according to the normalized input string to obtain a matching field; and acquiring information of a contact object containing the matching field as a contact searching result. The device comprises a preprocessing module, a receiving module, an input processing module, a searching module and an acquiring module.

Abstract: Systems and methods are provided for obtaining feedback associated with specific segments of a work. In some embodiments, a content provider may make one or more segments of the work available to commentators to provide feedback associated with a particular segment. The feedback may include ratings and/or comments. In some embodiments, feedback scores may be calculated using the feedback. Alternatively or additionally, content providers and/or other commentators may evaluate feedback provided by commentators. These evaluations may be used to calculate a commentator reputation score. Some feedback scores may be based at least in part on commentator reputation scores. In some embodiments, comparisons of feedback may be generated. For example, the comparisons may be based at least in part on feedback associated with one or more segments that is filtered based on demographic criteria that divide commentators into groups.

Abstract: A method and system for managing a search is disclosed. The method and system can include receiving a set of first results from a first query. A set of categories can be identified based on the set of first results. The method and system can include generating a set of second results using a second query having at least a portion of the first query, at least a portion of the first results, and at least a portion of the set of categories. The method and system can also include scoring the set of second results based upon a relationship of the first query, the second query, and the set of second results.

Abstract: Techniques are disclosed for generating a unified ranking of search results received from a plurality of distinct search resources. A computing system executing a federated search application receives a set of ranked search results from multiple search resources (e.g., web-based search engines, public databases and catalogs, etc.). Each search result identifies an item and includes metadata characterizing the item. The federated search application determines a unified ranking for the items identified in the search results that preserves a relative ranking of each set of items, such that a result for a given item is ranked above other results for items in the associated set of items is ranked above the other results in the unified ranking.

Abstract: A categorization analysis system is provided. The categorization analysis system includes one or more hardware processors, a memory including a first plurality of listings categorized in a first target category, and a categorization analysis engine executing on the one or more hardware processors. The categorization analysis engine is configured to determine a label for each listing including performing a search on title, select a set of training listings based on the determined labels, train a first model using the set of training listings and the determined labels, the first model being a classification model configured to classify categorization of listings, identify a suspect listing categorized in the first target category, apply the suspect listing to the first model, thereby generating a categorization result for the suspect listing, the categorization result indicating miscategorization of the suspect listing, and identify the suspect listing in the memory as miscategorized.

Abstract: A system and method for implementing a database system is presented. A database system comprises a load balancer and a database partitioned into a first and second shard. Coupled to the load balancer are a first plurality of database servers and a second plurality of database servers. Each of the first plurality of database servers contains a copy of the first shard of the database. Each of the second plurality of database servers contains a copy of the second shard of the database. Queries are sent to a database server in the first plurality of database servers based on a suitability score of the database server determined by characteristics of each server and a current status of each server, where the query is sent to the server in the first plurality with the highest suitability score. Other embodiments also are disclosed.

Abstract: A query relationship data structure (RELSTRUCT) generator configured to select a plurality of queries, each query structured for application against a database to yield a query result. The RELSTRUCT generator includes a query analyzer configured to identify query parts of individual queries, and determine for each query, a relation, if any, of an included query part to any query part of remaining queries of the plurality of queries. The RELSTRUCT generator also may create, for each query, a query relationship data structure in which the query is related to at least one other query of the plurality of queries, based on the determined relation of a query part of the query and a query part of the at least one other query of the plurality of queries.

Abstract: Data can be processed in parallel across a cluster of nodes using a parallel processing framework. Using Web services calls between components allows the number of nodes to be scaled as necessary, and allows developers to build applications on the framework using a Web services interface. A job scheduler works together with a queuing service to distribute jobs to nodes as the nodes have capacity, such that jobs can be performed in parallel as quickly as the nodes are able to process the jobs. Data can be loaded efficiently across the cluster, and levels of nodes can be determined dynamically to process queries and other requests on the system.

Abstract: A method and system for time dependent search is described. A search manager may receive a query for time dependent information relating to a base object and a time period. The search manager may search a search optimized storage system of technical objects for a technical object that matches the query. Each technical object may include a reference to time dependent information stored by a base object and a validity period. The validity period for each technical object is chosen by time stretching logic such that valid time dependent information is available for all time periods.

Abstract: Systems and methods for providing full data provenance visualization for versioned datasets. A method includes receiving selection of a versioned dataset that is within a data pipeline system. The method also includes determining the full data provenance of the selected versioned dataset. The full data provenance may comprise a set of versioned datasets. The method further includes providing for display of a visualization of the full data provenance of the selected versioned dataset. The visualization comprises a graph. The graph comprises a compound node for the selected versioned dataset and for each versioned dataset in the set of versioned datasets. The graph further comprises edges connecting the compounds nodes. Each edge represents a derivation dependency between versions of the versioned datasets represented by the compound nodes connected by the edge.

Abstract: A system and a computer program product for managing a database are disclosed. Managing the database includes managing a table of the database, the table having a set of fields including a first field in a first row of the table. Managing the table includes selecting, in the first field, a first input value configured to identify a first dynamic data function utilized to determine a first output value for the first field. Managing the table includes determining the first output value for the first field using the first dynamic data function. Managing the table includes returning (for a read request) the first output value for the first field.

Abstract: According to some embodiments, a method for processing input data comprises creating a MapReducer object corresponding to a MapReduce environment; and receiving, by a MapReduce interface, a plurality of input parameters comprising the input data; a mapper function; a reducer function; and the MapReducer object; and using the MapReduce interface to process the input data by one or more processors in the MapReduce environment using the mapper function and the reducer function. According to some embodiments, the method further comprises creating a second MapReducer object, wherein the second MapReducer object corresponds to a second MapReduce environment; receiving, by the MapReduce interface, the second MapReducer object in place of the first MapReducer object; and utilizing the MapReduce interface to process the input data by the one or more processors in the second MapReduce environment using the mapper function and the reducer function.

Abstract: An online network collects a dataset of an individual's information through a computer-implemented method. An individual enters a dataset of the information and a plurality of an individual's life events into a computer system. The dataset is arranged and converted into a graphical representation for display. The online database receives and stores the dataset. The database associates the dataset with the plurality of the member's life events and then the dataset and the life events are outputted into the graphical representation for display for a witness.

Abstract: According to one embodiment, a system includes a processor and logic integrated with and/or executable by the processor. The logic causes the processor to receive, at a remote site connected to a production site via a network, an incremental file list from the production site, each incremental file indicated by the incremental file list being either updated or new as determined during a time period between a data image at a previous synchronization (sync) point and a data image at a current sync point. The logic also causes the processor to tally a remote access count of each incremental file on the incremental file list received at the remote site by users at the remote site, record the tallied remote access counts in the incremental file list at the remote site, and transfer the incremental file list including the tallied remote access counts to the production site.

Abstract: Techniques are described for asynchronous communication of transaction data to client processes. A transaction request may be sent from a client process to a contract engine, which may perform multiple service calls to network services to generate transaction data for the transaction. The transaction data may be stored in an aggregate contract data object, and provided asynchronously to the client process for presentation via a user interface such as an e-commerce application. In some cases, the client process may, subsequently to the initial transaction request, send one or more requests for portions of the transaction data. Such requests may be sent asynchronously with respect to the initial transaction request. In some cases, the client process may provide callback information specifying a network location to which transaction data may be asynchronously communicated after it has been generated.

Abstract: Technologies are generally described for a data synchronization scheme. In some examples, a method performed under control of a client device may include connecting to a server based at least in part on user account login information; receiving, from the server, a data file stored in connection with the user account; storing the received data file in a local data storage; receiving a request to logout the client device; determining that the client device is disconnected from the server and/or that the data file stored on the local data storage is not synchronized with the data file stored in connection with the user account; and encrypting the data file stored on the local data storage.

Abstract: A method and associated systems for generating a virtual dynamic representative of a taxonomic group with unique inheritance of attributes. Each record of a continuously updated database identifies a “vertical” attribute of an entity associated with that record, and further identifies a “horizontal” attribute upon which a business decision may be based. An account-management apparatus selects a subset of these records that are associated with a particular value of the vertical attribute and identifies the most desirable value of the horizontal attribute that is associated with any of the selected records. The apparatus then creates a virtual representative of the subset that represents the subset as a taxonomic group associated with the particular value of the vertical attribute and associates all records of the group with the most desirable value of the horizontal attribute.

Abstract: Techniques are provided for automatically detecting homologies between documents based on structural characteristics. Various statistics relating to the COS structure of a PDF document are compiled. The statistics are input into a rolling hash function to generate a digital fingerprint of the document. Fingerprints from two similar documents will have small edit distances between them, and can therefore be classified similarly or provided as results to a fingerprint-based search. For example, an unclassified document may be classified in the same class as a representative document where the fingerprints of the two documents have a small edit distance between them. Since the structure of the document is used instead of the text content or renderings, it is possible to operate on encrypted documents. Further, representative elements of a particular class of documents can be selected for comparison against a target document for improved resolution of the results.

Abstract: A mechanism is provided in a question answering system for generating a usage report based on question categorization. The mechanism clusters documents from a corpus of documents to form a nested structure of clusters of documents. The mechanism record questions answered by question answering system in a database in association with answers returned and answer confidence values. The mechanism maps the questions to the nested structure of clusters of documents to form a nested structure of clusters of questions. The mechanism generates a usage report based on the nested structure of clusters of questions and presenting the usage report responsive to a requesting user.

Abstract: Disclosed aspects include a temporal relational database management system initiating a set of operations. A set of columns in a transaction time temporal table is identified for change categorization. A change categorization model is constructed. The change categorization model is based on a set of changes with respect to the set of columns in the transaction time temporal table. The change categorization model uses a cluster analysis technique. Based on the change categorization model, a group of change categories for a set of rows coupled with the set of columns in the transaction time temporal table is determined. Based on the change categorization model, a first change category of the group of change categories is established in a first row of the set of rows.

Abstract: Embodiments include determining a condition of category division of a key performance indicator. Aspects include dividing multiple pieces of workflow execution information into a division number for the type of the key performance indicator and generating a graph for each of the multiple groups after the division, from workflow execution information belonging to the group. Aspects also include calculating graph edit distances for respective two arbitrary graphs and generating a new group by merging two graphs having the shortest graph edit distance. Aspects further include calculating a graph edit distance for the new group and repeating the generation of the new group and the calculation of the graph edit distance for the new group, until the graph edit distance is equal to or more than a certain fixed edit distance.

Abstract: Described herein are methods, systems and computer program products for entity resolution. Entity resolution, also known as entity matching or record linkage, seeks to identify equivalent data objects between or among datasets. An example method includes creating a deterministic model by defining an entity to be resolved, selecting two datasets for comparison, defining matching predicates for attributes of the datasets to select a set of candidate matches, and defining a precedence rule for the candidate matches to select a subset of the candidate matches. The method includes running the deterministic model on the two datasets. Running the deterministic model includes applying the matching predicates and the precedence rule to data in the datasets that correspond to the attributes. The method also includes applying a cardinality rule to results of the running, and outputting the matching candidates for which the cardinality rule is satisfied.

Abstract: Generating a compliance framework. The compliance framework facilitates an organization's compliance with multiple authority documents by providing efficient methodologies and refinements to existing technologies, such as providing hierarchical fidelity to the original authority document; separating auditable citations from their context (e.g., prepositions and or informational citations); asset focused citations; SNED and Live values, among others.

Abstract: Techniques are described for spreading the data into statistically meaningful visualizations and generating reports. A method comprising providing a graphical user interface displaying a data chart and a plurality of available options for data spreading models, receiving a first user input via the graphical user interface selecting one or more data elements of the data chart, receiving a second user input via the graphical user interface selecting a data spreading model from among the plurality of available options for data spreading models, generating a revised data chart based on the one or more data elements of the data chart in accordance with the data spreading model, wherein the revised data chart renders the one or more data elements of the data chart in a modified representation within the chart in accordance with the data spreading model, and outputting for display the revised data chart.

Abstract: An embodiment of the invention may include a method, computer program product, and system for data management. The embodiment may include receiving a login token and instruction from a user device. The login token is associated with a user of the user device. The instruction may be reading or writing profile data belonging to the user. The embodiment may include determining whether a user profile container exists for the user based on the received login token. The embodiment may include creating the user profile container for the user based on determining that the user profile container does not exist. Creating the user profile container for the user may include identifying profile data belonging to the user located in a plurality of locations within a file system and storing identified profile data belonging to the user within a single binary large object. The embodiment may include executing the received instruction.

Abstract: A computer system and method to classify a plurality of users in a plurality of clusters in social media associating a text profile and text content with each user. The method comprises: generating a content feature vector for each of a portion of users on the basis of content associated with the portion of users; generating mapping the plurality of clusters, and the plurality of clusters and the portion of users, on the basis of the content feature vectors; generating a first profile feature vector for each of the plurality of clusters on the basis of the profiles associated with the portion of users mapped to each cluster; and classifying each of the other users excluding the portion of users in a plurality of clusters on the basis of the profiles associated with the other users and the first profile feature vectors.

Abstract: Herein, a display device, system and method are described for identifying digital content through comparison of one or more audio thumbnails when the digital content is provided without metadata. According to one embodiment, a display device comprises a display, audio conversion logic and a transceiver. The audio conversion logic is adapted to produce one or more audio thumbnails, which are compact representations of a snippet of audio from that incoming digital content without the metadata. The transceiver is adapted to transmit the one or more audio thumbnails in order to (i) retrieve metadata associated with the digital content from an external source separate from a source of the digital content and (ii) display information provided by the metadata on the display.

Abstract: System and method for accessibility testing of a web application is disclosed. Initially the system is configured to receive an accessibility standard and a level of conformance to be achieved for accessibility testing of a webpage associated with the web application. The system is further configured to identify a first set of an accessibility guidelines based on the accessibility standard and the level of conformance. The system further identifies a set of elements present in the webpage and determines a second set of the accessibility guidelines based upon the set of elements and a set of common guidelines applicable to all the webpage's of the web application. Furthermore, the system computes a number of occurrences of each element from the set of elements present in the webpage.

Abstract: Disclosed is a method and computing device that receives a web page and locates text elements in the web page, where each text element includes a set of one or more characters or symbols. For each text element found, the computing device assigns a weight value to the each text element. The computing device then stores the text from the each text element in a relevant text storage if the weight value for the each text element is above a threshold weight or similar in layout or content to elements above the threshold weight.

Abstract: Methods and system for managing media clips over a data network. Media streams may be received over a data network and stored by a storage server. Metadata regarding the media streams may be generated and stored at a metadata server. A control station can retrieve media frames originating in the stored media streams from the storage server, based on metadata. Media frames from multiple media streams can be retrieved and displayed in synchronization, based on respective timecodes.

Abstract: Methods and systems for identifying and presenting information are described. Search results are received from a search engine. An entity associated with a networked site is selected using a selection criterion. A determination is made as to whether the listing includes a link to the networked site or includes the link to the networked site at a list position that fails to satisfy a first criterion. After determining that the link to the site associated with the entity is not included in the search result listing, or that the link to the site associated with the entity is not at a position in the search result listing that satisfies the first criterion, the search listing is modified by causing the link to the site associated with the entity to appear in a first position in the search listing. The modified search listing is displayed on a user terminal.

Abstract: Methods and systems for searching logical patterns in voluminous multi sensor data from the industrial internet is provided. The method retrieves instances of patterns in time-series data where patterns are specified logically, using a sequence of symbols. The logical symbols used are a subset of the qualitative abstractions specifically, the concepts of steady, increasing, decreasing. Patterns can include symbol-sequences for multiple sensors, approximate duration as well as slope values for each symbol. To facilitate efficient querying, each sensor time-series is pre-processed into a sequence of logical symbols. Each position in the resulting compressed sequence is registered across a TRIE-based index structure corresponding to the multiple logical patterns it may belong to. Logical multi-sensor patterns are efficiently retrieved and ranked using such a structure. This method of indexing and searching provides an efficient mechanism for exploratory analysis of voluminous multi-sensor data.