Abstract: A batching module that inspects call stacks within a stack evaluator to identify current expressions that can be evaluated in batch with other expressions. If such expressions are identified, the corresponding stacks are blocked from further processing and a batch processing request for processing the expressions is transmitted to the application server. The application server processes the expressions in batch and generates a value for each of the expressions. The blocked stacks are then populated with the values for the expressions.

Abstract: A batching module that inspects call stacks within a stack evaluator to identify current expressions that can be evaluated in batch with other expressions. If such expressions are identified, the corresponding stacks are blocked from further processing and a batch processing request for processing the expressions is transmitted to the application server. The application server processes the expressions in batch and generates a value for each of the expressions. The blocked stacks are then populated with the values for the expressions.

Abstract: Systems and methods for sharing information between distributed computer systems connected to one or more data networks. In particular, a replication system implementing methodologies for sharing database information between computer systems where the databases use different classification schemes for information access control is disclosed.

Abstract: A system and method providing cross-ontology multi-master replication is described. In a first embodiment a method for cross-ontology multi-master replication comprising the steps of: obtaining, at an importing site, an exporting site ontology and a set of one or more database changes; wherein the exporting site ontology defines a set of one or more data types; and after mapping the exporting site ontology to an importing site ontology, incorporating the set of one or more database changes into a database including mapping each of one or more data types of the set of data types to a data type defined by the importing site ontology using an ontology map.

Abstract: An interactive, graph-based user interaction data analysis system is disclosed. The system is configured to provide analysis and graphical visualizations of user interaction data to a system operator. In various embodiments, interactive visualizations and analyzes provided by the system may be based on user interaction data aggregated across particular groups of users, across particular time frames, and/or from particular computer-based platforms and/or applications. According to various embodiments, the system may enable insights into, for example, user interaction patterns and/or ways to optimize for desired user interactions, among others. In an embodiment, the system allows an operator to analyze and investigate user interactions with content provided via one or more computer-based platforms, software applications, and/or software application editions.

Abstract: Techniques for visual data import into an object model are described. A graphical user interface concurrently displays a first icon that represents a first object type and a second icon that represents a second object type. Input defining object-to-data mappings between properties of the object types and structured data of one or more data sources is received. Further input defining a relationship type for relationships between the first object type and the second object type is also received. In response to the second input, a graphical representation of the relationship type is displayed, visually linking the first icon to the second icon. Based at least on the object-to-data mappings, the definition of the relationship type, and the structured data, an object model is created, comprising first objects of the first object type, second objects of the second object type, and relationships between the first objects and the second objects.

Abstract: Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations.

Abstract: Systems and methods are presented for data quality monitoring. Data quality monitors may be created and configured to identify objects with specified data quality issues and/or property values. Objects identified by a data quality monitor can be presented to users for confirmation and resolution. Properties used by the data quality monitor to match objects may also be displayed to users.

Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.

Abstract: Techniques in a data processor for drawing a density surface on a map in a manner that more accurately accounts for projection distortion in the map. According to one embodiment, data is maintained that represents a geotagged event. A map plane is divided into a plurality of cells and an origin cell corresponding to the geotagged event is identified. Density values are allocated to cells surrounding the origin cell based on geodetic distances between geographic coordinates corresponding to surrounding cells and the geographic coordinate of the geotagged event. A density surface based on the cell allocations is then displayed on a map. By allocating density values to cells based on geodetic distances, the resulting density surface displayed on the map more accurately accounts for projection distortions in the area of the map on which density surface is displayed.

Abstract: Techniques for visual data import into an object model are described. A graphical user interface concurrently displays a first icon that represents a first object type and a second icon that represents a second object type. Input defining object-to-data mappings between properties of the object types and structured data of one or more data sources is received. Further input defining a relationship type for relationships between the first object type and the second object type is also received. In response to the second input, a graphical representation of the relationship type is displayed, visually linking the first icon to the second icon. Based at least on the object-to-data mappings, the definition of the relationship type, and the structured data, an object model is created, comprising first objects of the first object type, second objects of the second object type, and relationships between the first objects and the second objects.

Abstract: Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations.

Abstract: Techniques for cross-ACL multi-master replication are provided. The techniques allow a replication site in a multi-master replication system implementing an asynchronous replication protocol and an access control policy to appropriately apply received data change updates to data maintained at the site even where a data change update is missing information because of the implemented access control policy.

Abstract: Processes, machines, and computer-readable media are provided for expanding and simplifying a polygon or reducing and simplifying a polygon. Polygon expanding or reducing logic receives information that represents a polygon having a set of vertices. The polygon expanding or reducing logic determines another polygon having another set of vertices, such that the other polygon encompasses or is encompassed by the polygon, by determining, for each vertex of the set of vertices, a new set of vertices that are derived from the vertex and are at least a particular distance outside or inside the polygon. The vertex reducing logic determines whether an intermediate vertex is within the particular distance of a proposed segment between two other vertices of the other set of vertices, even though the intermediate vertex is not on the proposed segment, and, if so, removing the intermediate vertex from the other set of vertices.

Abstract: A computer-based method and system for sharing and deconflicting data changes amongst a plurality of replication sites. In a particular embodiment, data changes at sites to data objects are tracked by each site on a per-data object basis using per-data object version vectors. In another particular embodiment, data changes at sites to links connecting two data objects are tracked by each site on a per-link set basis using per-link set version vectors. In another particular embodiment, per-object version vectors are used to detect a conflict resulting from concurrent changes at two or more sites in which one of the concurrent changes includes an object resolution change.

Abstract: Processes, machines, and computer-readable media are provided for expanding and simplifying a polygon or reducing and simplifying a polygon. Polygon expanding or reducing logic receives information that represents a polygon having a set of vertices. The polygon expanding or reducing logic determines another polygon having another set of vertices, such that the other polygon encompasses or is encompassed by the polygon, by determining, for each vertex of the set of vertices, a new set of vertices that are derived from the vertex and are at least a particular distance outside or inside the polygon. The vertex reducing logic determines whether an intermediate vertex is within the particular distance of a proposed segment between two other vertices of the other set of vertices, even though the intermediate vertex is not on the proposed segment, and, if so, removing the intermediate vertex from the other set of vertices.

Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.

Abstract: A workflow application allows users to store, manage, and perform tasks related to workflows comprised of ordered sets of documents. The application provides an interface for creating and managing a workflow. Each document added to the workflow is assigned to a particular position in the workflow. Via the interface, the user saves data defining the workflow. In this manner, the workflow may be shared or preserved for subsequent re-use. The application allows a user to perform various tasks with respect to the workflow. Via an interface control presented by the application, the user instigates such tasks. In response, the application causes the task to be performed for each document in the workflow in an order corresponding to the arrangement of the documents within the workflow. For example, the application may render and print each document in the workflow. Or, the application may generate a combined workflow report.

Abstract: Techniques for cross-ACL multi-master replication are provided. The techniques allow a replication site in a multi-master replication system implementing an asynchronous replication protocol and an access control policy to appropriately apply received data change updates to data maintained at the site even where a data change update is missing information because of the implemented access control policy.

Abstract: In one embodiment, first, second, and third inputs are received. The first input specifies a first market instrument and the second input specifies start and end dates of a first time series for the first market instrument. The third input specifies a feature set computer and the values of zero or more parameters thereof. A first feature set of the first market instrument is determined by applying the feature set computer to the first time series. A second feature set of a second market instrument is determined by applying the feature set computer to a second time series for the second market instrument, where the second time series is bounded by the start and end dates. The second feature set is correlated to the first feature set to determine a similarity score for the second market instrument, where the similarity score is a measure of the relationship between the second market instrument and the first market instrument.