Abstract: A screen reader application traverses each node in a document object model (DOM) for the text stylization. Properties for foreground color, background color, font type, font size and font stylization are algorithmically reduced to an identifier. Each node in the DOM with the same identifier has the same text stylization. Unique and infrequent text stylizations by a webpage author signal a point of interest. The screen reader application locates and navigates to that node in the DOM on behalf or in response to the end user. Points of interest are further identified by a number of additional factors. A first includes percentage of text of having the text stylization versus total text in the DOM. A second includes excluding candidate point of interest nodes having more than 250 characters. Others include imposing minimum font sizes and text contrast ratios to qualify as a point of interest.

Abstract: A spreadsheet supports formulas in cells that trigger queries of a data source. The parameters for queries can include or depend on values in other cells in the spreadsheet. Thus, the precise query submitted to the data source is dynamic, being dependent on the data and formulas in the spreadsheet. Furthermore, on receiving the query results, they are added to cells in the spreadsheet, which can be parameters for other queries defined in other cells. Changing the value of a single cell can automatically trigger an update of an arbitrarily deep hierarchy of calculations that can include an arbitrary number of data source queries.

Abstract: Embodiments are directed to a multi-tenant cloud system that provisions new customer accounts. Embodiments include a dedicated database schema and a shared database schemas. Embodiments provision a new customer account by determining whether the new customer account is a first type of account or a second type of account. When the new customer account is the first type of account, embodiments allocate the new customer account to the one of the shared database schemas. When the new customer account is the second type of account, embodiments allocate the new customer account to a dedicated schema.

Abstract: Computer implemented systems and methods are disclosed for automatically and canonically identifying related data in various data structures while maintaining secure access to individual data objects and their properties. Data structures may include a plurality of records, wherein each record is associated with a respective entity. Access to individual records, or in some embodiments access to individual attributes of a record, may be restricted to particular users or groups on a per-item basis. In accordance with some embodiments, systems and methods are disclosed for identifying pairs of records, determining a probability that both records relate to a common entity, and securely notifying and presenting users with information regarding the probability while preserving the access restrictions for the individual records and attributes. Record pairs that potentially refer to the same entity may be linked, reconciled, or ignored in response to feedback from users who have access to one or both records.

Abstract: A query is received at a database execution engine. A query plan is generated by the database execution engine and for execution of the query. The query plan includes a first operator including computer executable instructions that upon execution queries a data structure of a database, determines whether the data structure satisfies a precondition for execution of a second operator of the query plan, and generates a signal indicating that the precondition is not satisfied. Execution of the query plan is initiated. A new query plan is generated by the database execution engine and in response to receiving the signal indicating that the precondition is not satisfied. Related systems, methods, and articles of manufacture are also described.

Abstract: Disclosed herein are system, method, and computer program product embodiments for replaying a large concurrency workload. The embodiments disclosed herein may be used to test the workload capacity of a database. An embodiment operates by executing a first database transaction statement to a database. The execution status of the first database transaction statement is checked and the number of work threads connecting to the database is adjusted. In an embodiment, the number of work threads used may be less than the number of sessions simulated.

Abstract: Among other things, in one aspect, in general, a system for managing data in a data storage system includes a plurality of index nodes each storing a map of entries, each entry of the map including an identifier corresponding to a particular portion of data stored in the data storage system, and metadata indicating a location where the particular portion of data is stored in the data storage system, and one or more supernodes configured to return an identification of an index node that recently submitted a request for a particular identifier associated with at least one of the portions of data.

Abstract: Techniques for request throttling in a provider network environment are described. A throttle handler controls whether requests will be processed through maintaining a token-based record, per type of request, having a token value indicative of a number of requests that can be processed over a time period. For a request, the token value of the token-based record corresponding to the request type is updated based on calculating an elapsed time between a last update time of the token-based record and the current time, calculating an intermediate token value as the existing token value plus a value of the elapsed time multiplied by a rate, and updating the token value to be the minimum between the intermediate token value and a burst value. The request is serviced when the updated token value is determined to be greater than or equal to a number of tokens needed to perform the request.

Abstract: Systems and methods of returning location and/or event results using information mined from non-textual information are provided. Non-textual information is captured using a hardware component of a user device. Text-based social media content input on the user device is then retrieved. A location of the user device is determined using a global positioning system module in the user device. The non-textual information is converted to a machine-analyzable format, and the converted non-textual information is compared to a database of converted non-textual information samples to analyze and classify the converted non-textual information. The classification is sent to a server for storage in a database in a manner that ties the classification to the geographical location of the user device.

Abstract: A spreadsheet supports formulas in cells that trigger queries of a data source. The parameters for queries can include or depend on values in other cells in the spreadsheet. Thus, the precise query submitted to the data source is dynamic, being dependent on the data and formulas in the spreadsheet. Furthermore, on receiving the query results, they are added to cells in the spreadsheet, which can be parameters for other queries defined in other cells. Changing the value of a single cell can automatically trigger an update of an arbitrarily deep hierarchy of calculations that can include an arbitrary number of data source queries.

Abstract: Techniques are provided for dependency aware parallel splitting of operations. For example, a count of pending data operations being executed by a first node and replicated in parallel to a second node are tracked. A metadata operation is executed at the first node based upon the count being less than a threshold (e.g., the count being zero). A first list of affected inodes modified by the metadata operation is identified. A dependency of the metadata operation with respect to pending metadata operations replicated to the second node is determined. The metadata operation is dispatched to the second node based upon the dependency indicating that the metadata operation is independent of the pending metadata operations.

Abstract: A method constructs data visualization options. A user selects data fields from a data set. The process identifies a first plurality of data visualizations that use all of the user-selected data fields. For each data visualization, the process computes a score, based in part on visual patterns corresponding to statistical properties of data values of a user-selected data field. The process also identifies a second plurality of data visualizations, each using a majority of the user-selected data fields and also using a respective additional data field that is not one of the user-selected data fields. For each of the second plurality of data visualizations, the process computes a respective score, which uses data values of the respective additional data field. The process forms a recommended set of data visualizations including high-scoring data visualizations from both the first and second pluralities. The process presents the recommended data visualizations to the user.

Abstract: The present invention maintains data consistency of an entire system. A distributed transaction system includes a service information management device that manages a service provided by each device existing in the distributed transaction system, a data consistency strategy management device that manages a data consistency strategy describing a strategy relating to data consistency maintenance in the distributed transaction system, a distributed transaction processing device that executes a distributed transaction, inquires the data consistency strategy management device and the service information management device after the execution of the distributed transaction, and outputs feedback information relating to data consistency maintenance on the basis of the data consistency strategy, the service information, and the execution result. One or more data consistency maintaining devices acquire the feedback information to execute a process relating to the data consistency maintenance.

Abstract: Free spaces of a plurality of databases including the same data are monitored. The free spaces depend on fragmentation states of the respective databases. A first database is determined to be an active database, and a second database whose free space is larger than that of the first database is determined to be a standby database. Data relocation processing is performed on the second database, the data relocation processing including suspending data synchronization, initializing the standby database, copying data of the active database to the standby database, and resuming the data synchronization. Controlling is performed so that the data relocation processing is performed on a database other than the second database by changing the active database and the standby database.

Abstract: Embodiments of the present specification provide a method for updating a database by using a two-phase commit distributed transaction. The method is applied to a coordinator, and includes: sending a first-phase prepare request message to each participant to end a current transaction, the current transaction being configured to update a target database record; and after receiving write lock advance release requests sent by all participants, returning a write lock advance release response to each participant to instruct each participant to unlock a target database record of the participant, the write lock advance release requests being sent by the participants after the participants successfully write a log of an update operation of the current transaction to a log buffer.

Abstract: In some embodiments, techniques are provided for improving the detection of repeated actions during the manipulation of tabular data in order to enable the creation of automated action sequences. Activity log records are created that represent actions taken with respect to a set of tabular data. One or more normalized versions of the activity log records may be created. The activity log records (and, in some embodiments, the normalized versions of the activity log records) may be grouped and hashed together, such that groups of activity log records may be compared to each other by comparing the resulting hashes. Grouping and hashing may allow large numbers of comparisons to be made efficiently enough to support detection of repeated actions on large scale, multi-user, and multi-tenant systems.

Abstract: Methods, systems, and devices, including computer programs encoded on computer storage media, for payment are provided. One of the methods includes: sending a consensus proposal for at least one pending-consensus transaction in a transaction pool of the consensus master node to a target consensus backup node of the blockchain, wherein the consensus proposal comprises a transaction hash list, and the transaction hash list comprises a transaction hash of the at least one pending-consensus transaction; matching the transaction hash in the consensus proposal with transactions in a transaction pool of the target consensus backup node; in response to the transaction hash being matched, obtaining, from the transaction pool of the target consensus backup node, transaction information of the matched at least one pending-consensus transaction; and executing a process of the consensus proposal based on the transaction information.

Abstract: An information processing apparatus comprising accepting means, transmission means, reception means and display means, wherein in a case where a plurality of pieces of link information is included in a search result and one of the pieces of link information is selected, the transmission means transmits a request for a Web page to a destination server in accordance with that link information, and the information processing apparatus further comprises processing means for, with respect to the Web page received in accordance with the request, searching in that Web page for the search term and processing by inserting a tag for performing an emphasized display of that search term into that Web page, and the display means displays the Web page, into which the tag for the emphasized display is inserted, emphasizing the search term in that Web page.

Abstract: Systems and techniques for exploring relationships among entities are disclosed. The systems and techniques provide an entity-based information analysis and content aggregation platform that uses heterogeneous data sources to construct and maintain an ecosystem around tangible and logical entities. Entities are represented as vertices in a directed graph, and edges are generated using entity co-occurrences in unstructured documents and supervised information from structured data sources. Significance scores for the edges are computed using a method that combines supervised, unsupervised and temporal factors into a single score. Important entity attributes from the structured content and the entity neighborhood in the graph are automatically summarized as the entity fingerprint. Entities may be compared to one another based on similarity of their entity fingerprints. An interactive user interface is also disclosed that provides exploratory access to the graph and supports decision support processes.

Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.