No file available
To read the file of this research,
you can request a copy directly from the authors.
Exploiting Information Centric Networking to federate NoSQL Spatial Databases
Preprints and early-stage research may not have been peer reviewed yet.
Abstract
This paper explores methodologies, challenges and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases. ICN services allow simplifying the design of federation procedures, improving their performance, and providing so-called data-centric security. In this work present an architecture able to federate NoSQL spatial databases and evaluate its performance, by using a real data set within a heterogeneous federation formed by MongoDB and CouchBase database systems.
ResearchGate has not been able to resolve any citations for this publication.
In some network and application scenarios, it is useful to cache content in network nodes on the fly, at line rate. Resilience of in-network caches can be improved by guaranteeing that all content therein stored is valid. Digital signatures could be indeed used to verify content integrity and provenance. However, their operation may be much slower than the line rate, thus limiting caching of cryptographically verified objects to a small subset of the forwarded ones. How this affects caching performance? To answer such a question, we devise a simple analytical approach which permits to assess performance of an LRU caching strategy storing a randomly sampled subset of requests. A key feature of our model is the ability to handle traffic beyond the traditional Independent Reference Model, thus permitting us to understand how performance vary in different temporal locality conditions. Results, also verified on real world traces, show that content integrity verification does not necessarily bring about a performance penalty; rather, in some specific (but practical) conditions, performance may even improve.
This paper presents some problems and solutions concerning the federation of several geographical databases, in the context of interoperability. When a multi-database query is executed, it is important to route it only to sites which are likely to contribute to the answer, whatever the fragmentation might be, geographical, thematic or heterogeneous. Secondly, when the answer implies several spatial databases, it is important that not only boundary alignment is achieved, but also topological continuity. After describing several general problems and concepts about distributed spatial databases and their integration, structures for spatial indexing in multi-database systems are described, giving emphasis to local and global spatial indices. An r -tree-like structure is proposed for organizing those global indices. Geographical fragmentation presents disadvantages to artificially cut geographical objects, such as roads, rivers, etc. In other words, some objects, called fragmented objects, have the particularity of having several database identifiers (one per site) and a mechanism must be provided in order to re-construct those objects when necessary. In this paper, special tools are presented in order to ensure continuity of fragmented objects, semantically (at the level of identifiers), topologically (at the level of data structure) and geometrically (at the level of coordinates, possibly with errors). In order to accelerate queries against fragmented objects, some adjacency tables must be constructed. Truly seamless GIS data will only exist on the Internet once spatial continuity is ensured.
A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures can be developed. We then define a methodology for developing one of the popular architectures of an FDBS. Finally, we discuss critical issues related to developing and operating an FDBS.
This paper explores methodologies, advantages and challenges related to the use of Information Centric Networking (ICN) for realizing distributed spatial databases. Our findings show that the ICN functionality perfectly fits database requirements: routing-by-name can be used to dispatch queries and insertions, in-network caching to accelerate queries, and data-centric security to implement secure multi-tenancy. We present an ICN-based distributed spatial database, named OpenGeoBase, and describe design choices that lead to performance suitable for real world applications. Thanks to ICN, OpenGeoBase can quickly and efficiently provide massive information to database users; easily operate in a distributed way, deploying and using many database engines in parallel; secure every piece of content in a customizable way; naturally slice resources, so that several tenants and users can use the database in parallel and independently. We also show how OpenGeoBase can support an Intelligent Transport System application, by enabling fast responses to continent-wide queries about stops, routes, trips, schedules, real-time updates,fares, etc.
Securing communication in network applications involves many complex tasks that can be daunting even for security experts. The Named Data Networking (NDN) architecture builds data authentication into the network layer by requiring all applications to sign and authenticate every data packet. To make this authentication usable, the decision about which keys can sign which data and the procedure of signature verification need to be automated. This paper explores the ability of NDN to enable such automation through the use of trust schemas. Trust schemas can provide data consumers an automatic way to discover which keys to use to authenticate individual data packets, and provide data producers an automatic decision process about which keys to use to sign data packets and, if keys are missing, how to create keys while ensuring that they are used only within a narrowly defined scope ("the least privilege principle"). We have developed a set of trust schemas for several prototype NDN applications with different trust models of varying complexity. Our experience suggests that this approach has the potential of being generally applicable to a wide range of NDN applications.
This paper presents the design of the Named-data Link State Routing protocol (NLSR), a routing protocol for Named Data Networking (NDN). Since NDN uses names to identify and retrieve data, NLSR propagates reachability to name prefixes instead of IP prefixes. Moreover, NLSR differs from IP-based link-state routing protocols in two fundamental ways. First, NLSR uses Interest/Data packets to disseminate routing updates, directly benefiting from NDN's data authenticity. Second, NLSR produces a list of ranked forwarding options for each name prefix to facilitate NDN's adaptive forwarding strategies. In this paper we discuss NLSR's main design choices on (1) a hierarchical naming scheme for routers, keys, and routing updates, (2) a hierarchical trust model for routing within a single administrative domain, (3) a hop-by-hop synchronization protocol to replace the traditional network-wide flooding for routing update dissemination, and (4) a simple way to rank multiple forwarding options. Compared with IP-based link state routing, NLSR offers more efficient update dissemination, built-in update authentication, and native support of multipath forwarding.
The contemporary approach to database system architecture requires the complete integration of data into a single, centralized database; while multiple logical databases can be supported by current database management software, techniques for relating these databases are strictly ad hoc. This problem is aggravated by the trend toward networks of small to medium size computer systems, as opposed to large, stand-alone main-frames. Moreover, while current research on distributed databases aims to provide techniques that support the physical distribution of data items in a computer network environment, current approaches require a distributed database to be logically centralized.
We propose a definition of a spatial database system as a database system that offers spatial data types in its data model and query language, and supports spatial data types in its implementation, providing at least spatial indexing and spatial join methods. Spatial database systems offer the underlying database technology for geographic information systems and other applications. We survey data modeling, querying, data structures and algorithms, and system architecture for such systems. The emphasis is on describing known technology in a coherent manner, rather than listing open problems.
- S Salsano
- A Detti
- M Cancellieri
- M Pomposini
- N Blefari-Melazzi
S. Salsano, A. Detti, M. Cancellieri, M. Pomposini, N. Blefari-Melazzi,
Transport-layer issues in information centric networks, in: Proceedings of the
second edition of the ICN workshop on Information-centric networking, ACM,
2012, pp. 19-24.
Spatial indexing in microsoft sql server
- Y Fang
- M Friedman
- G Nair
- M Rys
- A.-E Schmid
Y. Fang, M. Friedman, G. Nair, M. Rys, A.-E. Schmid, Spatial indexing in microsoft sql server 2008, in: Proceedings of the 2008 ACM SIGMOD International
Conference on Management of Data, SIGMOD '08, ACM, New York, NY, USA,
2008, pp. 1207-1216. doi:10.1145/1376616.1376737.
URL http://doi.acm.org/10.1145/1376616.1376737
28
Size-constrained weighted set cover
- L Golab
- F Korn
- F Li
- B Saha
- D Srivastava
L. Golab, F. Korn, F. Li, B. Saha, D. Srivastava, Size-constrained weighted set
cover, in: Data Engineering (ICDE), 2015 IEEE 31st International Conference
on, IEEE, 2015, pp. 879-890.