IMPLEMENTING A MULTI-COLUMN/MULTI-ROW CONSTRAINT IN A RELATIONAL DATABASE TABLE
    1.
    发明申请
    IMPLEMENTING A MULTI-COLUMN/MULTI-ROW CONSTRAINT IN A RELATIONAL DATABASE TABLE 有权
    在关系数据库表中执行多列/多维约束

    公开(公告)号:US20140250060A1

    公开(公告)日:2014-09-04

    申请号:US13782964

    申请日:2013-03-01

    CPC classification number: G06F17/30345

    Abstract: A method, system, and computer program product for implementing a multi-column/multi-row constraint. Lock techniques prevent access collisions even when two or more concurrently running software applications are attempting to insert rows into the same relational database table (subject to the same multi-column/multi-row constraints). The method commences by receiving (e.g., from a first process) a first row to be inserted into a relational database table where the row comprises at least two constrained columns corresponding to the multi-column/multi-row constraint, then receiving (e.g., from a second process) a second row to be inserted into the same table. Using column locks, the method recognizes the potential for conflicting row insertions, and manages locks to prevent conflicting access grants to the two constrained columns of the existing database table. The evaluation of the multi-column/multi-row constraint is performed over the first row to be inserted and a row or rows of the relational database table.

    Abstract translation: 一种用于实现多列/多行约束的方法,系统和计算机程序产品。 锁定技术即使当两个或多个并发运行的软件应用程序试图将行插入到相同的关系数据库表(受同一个多列/多行限制)时,也可以防止访问冲突。 该方法通过从第一进程接收(例如,从第一进程)插入到关系数据库表中的第一行开始,其中该行包括与多列/多行约束对应的至少两个约束列,然后接收(例如, 从第二个进程)第二行插入到同一个表中。 使用列锁,该方法识别出可能存在冲突的行插入,并且管理锁以防止对现有数据库表的两个受限列的冲突访问许可。 多行/多行约束的评估是在要插入的第一行和关系数据库表的一行或多行中执行的。

    GENERATING VIRTUAL MAP TILES ACCORDING TO AN AD HOC SPECIFICATION

    公开(公告)号:US20170108347A1

    公开(公告)日:2017-04-20

    申请号:US15172196

    申请日:2016-06-03

    CPC classification number: G01C21/32

    Abstract: Computerized systems, methods, and other embodiments associated with generating virtual map tiles according to an ad hoc specification are described. In one embodiment, a method includes defining, in response to receiving a request through an interface of a map server, virtual map tiles according to an ad hoc specification. The ad hoc specification indicates characteristics of the virtual map tiles including at least a format and map content of the virtual map tiles. The method includes computing the virtual map tiles from at least the map content specified by the ad hoc specification and according to the format indicated by the ad hoc specification. Computing the virtual map tiles includes computing the virtual map tiles in response to receiving the request. The method includes transmitting the virtual map tiles to a client device to cause the viewable region of the electronic map to be displayed on the client device.

    SPATIAL INDEXING FOR DISTRIBUTED STORAGE USING LOCAL INDEXES

    公开(公告)号:US20170337229A1

    公开(公告)日:2017-11-23

    申请号:US15248155

    申请日:2016-08-26

    CPC classification number: G06F16/2272 G06F16/2237 G06F16/2246 G06F16/29

    Abstract: Systems, methods, and other embodiments associated with indexing spatial data in a distributed file system using local indexes are described. In one embodiment, a method includes dividing the spatial data into splits. Each of the splits includes a portion of the spatial data and includes additional sub-units that further sub-divide the spatial data. The example method may also include populating index records for the sub-units using metadata extracted from the spatial data. The metadata for each of the sub-units describes sub-unit characteristics of a respective one of the sub-units and split characteristics of one of the splits associated with the respective one of the sub-units. The method includes indexing the spatial data by generating local indexes using the index records with one of the local indexes for each of the splits and generating a global index that identifies the local indexes.

    INDEX-BASED OPTIMIZATION OF CONVEX HULL AND MINIMUM BOUNDING CIRCLE QUERIES
    5.
    发明申请
    INDEX-BASED OPTIMIZATION OF CONVEX HULL AND MINIMUM BOUNDING CIRCLE QUERIES 有权
    基于索引的索引优化和最小循环查询

    公开(公告)号:US20150254302A1

    公开(公告)日:2015-09-10

    申请号:US14200415

    申请日:2014-03-07

    Abstract: Systems, methods, and other embodiments associated with index-based optimization of geometric figured-related queries are described. In one embodiment, a method includes receiving two points selected from a corpus of spatial data. A hierarchical index on the data is accessed to choose candidate nodes. The index is a hierarchical arrangement of nodes arranged in paths from root node entries to leaf node entries such that each node is contained in all nodes in a path leading to the node. The method includes determining a spatial relationship between the two points and the candidate nodes in the index. The candidate nodes are a proper subset of the nodes in the index, such that the spatial relationship is not determined between the two points and some non-candidate nodes. A candidate node is selected based on the determined angles for processing related to construction of a geometric figure describing the spatial data.

    Abstract translation: 描述与几何图形相关查询的基于索引的优化相关联的系统,方法和其他实施例。 在一个实施例中,一种方法包括接收从空间数据的语料库中选择的两个点。 访问数据上的层次索引以选择候选节点。 索引是从根节点条目到叶节点条目的路径中排列的节点的分层排列,使得每个节点被包含在通向节点的路径中的所有节点中。 该方法包括确定索引中两点和候选节点之间的空间关系。 候选节点是索引中节点的适当子集,使得在两个点和一些非候选节点之间没有确定空间关系。 基于与描述空间数据的几何图形的构造相关的处理的确定的角度来选择候选节点。

    FEATURE GENERALIZATION USING TOPOLOGICAL MODEL
    6.
    发明申请
    FEATURE GENERALIZATION USING TOPOLOGICAL MODEL 有权
    使用拓扑模型的特征综合

    公开(公告)号:US20150161438A1

    公开(公告)日:2015-06-11

    申请号:US14097388

    申请日:2013-12-05

    Abstract: Systems, methods, and other embodiments associated with feature generalization leveraging topological model functionality are described. In one embodiment, a method includes loading primitives associated with a first feature and a second feature into a topological model. The topological model may be an existing topological model or a topological model that is created by the feature generalization methods and systems described herein. The topological model stores primitives that are shared by the first feature and the second feature as a single unique shared primitive. The method includes generalizing respective primitives including at least one shared primitive to produce corresponding respective generalized primitives, and associating a generalized primitive corresponding to the shared primitive with the first feature and the second feature, while maintaining alignment across shared edges of adjacent features and hierarchical relationships between features.

    Abstract translation: 描述了利用拓扑模型功能的特征泛化相关联的系统,方法和其他实施例。 在一个实施例中,一种方法包括将与第一特征相关联的图元和第二特征加载到拓扑模型中。 拓扑模型可以是由本文描述的特征泛化方法和系统创建的现有拓扑模型或拓扑模型。 拓扑模型将由第一个特征和第二个特征共享的原语存储为一个唯一的共享基元。 该方法包括对包括至少一个共享原语的各个基元进行泛化,以产生对应的各自的广义基元,以及将对应于共享基元的通用原语与第一特征和第二特征相关联,同时保持相邻特征和层次关系的共享边缘 特征之间。

Patent Agency Ranking