A Peer-to-Peer Data Structure for Dynamic Location Data

2006 ◽  
Author(s):  
D. Heutelbeck ◽  
M. Hemmje
Keyword(s):  
Data Structure ◽  
Peer To Peer ◽  
Location Data ◽  
Dynamic Location

Analyzing Purchase Decisions Using Dynamic Location Data

2021 ◽  
Author(s):  
Tal Shoshani ◽  
Peter Pal Zubcsek ◽  
Shachar Reichman
Keyword(s):  
Purchase Decisions ◽  
Location Data ◽  
Dynamic Location

Blockchains and the economic institutions of capitalism

2018 ◽  
Vol 14 (4) ◽  
pp. 639-658 ◽  
Author(s):  
SINCLAIR DAVIDSON ◽  
PRIMAVERA DE FILIPPI ◽  
JASON POTTS
Keyword(s):  
Data Structure ◽  
Digital Technology ◽  
General Purpose ◽  
Peer To Peer ◽  
Economic Institutions ◽  
Institutional Evolution ◽  
Network Computing ◽  
General Purpose Technology ◽  
Peer Network ◽  
Peer To Peer Network

AbstractBlockchains are a new digital technology that combines peer-to-peer network computing and cryptography to create an immutable decentralised public ledger. Where the ledger records money, a blockchain is a cryptocurrency, such as Bitcoin; but ledger entries can record any data structure, including property titles, identity and certification, contracts, and so on. We argue that the economics of blockchains extend beyond analysis of a new general purpose technology and its disruptive Schumpeterian consequences to the broader idea that blockchains are an institutional technology. We consider several examples of blockchain-based economic coordination and governance. We claim that blockchains are an instance of institutional evolution.

A fault tolerant peer-to-peer spatial data structure

2016 ◽  
Vol 10 (4) ◽  
pp. 874-886
Author(s):  
Pouya Bisadi ◽  
Zahra Mirikharaji ◽  
Bradford G. Nickerson
Keyword(s):  
Data Structure ◽  
Spatial Data ◽  
Fault Tolerant ◽  
Peer To Peer ◽  
Spatial Data Structure

scholarly journals DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS

1992 ◽  
Vol 02 (03) ◽  
pp. 311-333 ◽  
Author(s):  
YI-JEN CHIANG ◽  
ROBERTO TAMASSIA
Keyword(s):  
Data Structure ◽  
Point Location ◽  
Worst Case ◽  
Dynamic Data ◽  
Location Data ◽  
Insertion And Deletion ◽  
Planar Point Location ◽  
Vertex Insertion ◽  
Trapezoid Method ◽  
Dynamic Data Structure

We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let n be the current number of vertices of the subdivision. Point location queries take O( log n) time, while updates take O ( log 2 n) time (amortized for vertex insertion/deletion and worst-case for the other updates). The space requirement is O(n log n). This is the first fully dynamic point location data structure for monotone subdivisions that achieves optimal query time.

Sign in / Sign up

Export Citation Format

Share Document