191,320 Hits in 4.5 sec

Database techniques for linked data management

Andreas Harth, Katja Hose, Ralf Schenkel
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
Querying the data is a key functionality required to make use of the wealth of rich interlinked data.  ...  As such, the tutorial focuses on applying database techniques to processing Linked Data, such as optimized indexing and query processing methods in the centralized setting as well as distributed approaches  ...  The growing availability and use of Linked Data has led to an increasing need for systems that can store Linked Data and, more importantly, efficiently evaluate complex queries over large bodies of interlinked  ... 
doi:10.1145/2213836.2213909 dblp:conf/sigmod/HarthHS12 fatcat:pbxgg3dnavbc5onjn2e4lmwu54

FedX: A Federation Layer for Distributed Query Processing on Linked Open Data [chapter]

Andreas Schwarte, Peter Haase, Katja Hose, Ralf Schenkel, Michael Schmidt
2011 Lecture Notes in Computer Science  
We present FedX, a project which extends the Sesame Framework with a federation layer that enables efficient query processing on distributed Linked Open Data sources.  ...  On the query level, though, techniques have to be developed to meet the requirements of efficient query computation in the distributed setting.  ...  FedX -Design and System Overview FedX 2 is being developed to provide an efficient solution for distributed query processing on Linked Open Data.  ... 
doi:10.1007/978-3-642-21064-8_39 fatcat:5tn35zysovc3jarbwk5ds7grmm

Searchable Querical Data Networks [chapter]

Farnoush Banaei-Kashani, Cyrus Shahabi
2004 Lecture Notes in Computer Science  
Subsequently, as the first step toward realizing the evolved vision of QDN as a large-scale distributed query processing system, we propose an efficiently searchable QDN model based on a recently developed  ...  We discuss in details how our QDN model enables effective location of the data relevant to a QDN query.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1007/978-3-540-24629-9_3 fatcat:pu6fkom3y5c4llvah6ecdbtxki

Linked Data Indexing Methods: A Survey [chapter]

Martin Svoboda, Irena Mlýnková
2011 Lecture Notes in Computer Science  
Despite the research effort in recent years, several questions in the area of Linked Data indexing and querying remain open, not only since the amount of Linked Data globally available significantly increases  ...  In particular, our goal is to focus on large amounts of distributed and highly dynamic data.  ...  Since the concept of Linked Data emerged to support the idea of the Web of Data, we cannot ignore its main feature based on data distribution.  ... 
doi:10.1007/978-3-642-25126-9_59 fatcat:bbxb7nhq4fcipjal23kbya3mha

Interoperable and Efficient: Linked Data for the Internet of Things [chapter]

Eugene Siow, Thanassis Tiropanis, Wendy Hall
2016 Lecture Notes in Computer Science  
We show with established benchmarks that in comparison to storing the data in a traditional Linked Data store, our approach provides gains in both storage efficiency and query performance from over 3 times  ...  Two requirements to utilise the large source of time-series sensor data from the Internet of Things are interoperability and efficient access.  ...  Linked Data is a set of best practices for publishing data on the Web so that distributed, structured data can be interconnected and made more useful by semantic queries [4] .  ... 
doi:10.1007/978-3-319-45982-0_15 fatcat:q7nezpduzndankjlslw3hie6mq

An efficient peer-to-peer indexing tree structure for multidimensional data

Rong Zhang, Weining Qian, Aoying Zhou, Minqi Zhou
2009 Future generations computer systems  
While keeping the query efficiency in O(log N ) in terms of routing hops, SDI has extremely low maintenance cost which is proved through theoretical analysis.  ...  greatly limits the scalability of applications and dimensionality of data to be indexed.  ...  -For the query processing algorithm, we use the parallel query distribution which will promise query efficiency to be O(log N ).  ... 
doi:10.1016/j.future.2008.02.010 fatcat:ju7r3gyjhbfhpbmztyccixnjdm

SDI: A Swift Tree Structure for Multi-dimensional Data Indexing in Peer-to-Peer Networks

Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
2007 Proceedings of the 2nd International ICST Conference on Scalable Information Systems  
Keywords multi-dimensional data, peer-to-peer, point query, range query 1 We define root is on the lowest level and the leaves are on the highest level INFOSCALE • SDI scales well in terms of query radius  ...  Efficient multi-dimensional data search has received much attention in centralized systems.  ...  INTRODUCTION Efficient multi-dimensional data search is a key challenge for data management in large-scale distributed systems.  ... 
doi:10.4108/infoscale.2007.908 dblp:conf/infoscale/ZhangQZZ07 fatcat:qhkhymghebftlhgaftnyl2w5pm

FedX: Optimization Techniques for Federated Query Processing on Linked Data [chapter]

Andreas Schwarte, Peter Haase, Katja Hose, Ralf Schenkel, Michael Schmidt
2011 Lecture Notes in Computer Science  
In experiments, we demonstrate the practicability and efficiency of our framework on a set of real-world queries and data sources from the Linked Open Data cloud.  ...  Motivated by the ongoing success of Linked Data and the growing amount of semantic data sources available on the Web, new challenges to query processing are emerging.  ...  Architecture and Design FedX has been developed to provide an efficient solution for distributed query processing on Linked Data.  ... 
doi:10.1007/978-3-642-25073-6_38 fatcat:3mgfop65s5dmbpmkterq4j2hve

A Hilbert Curve-Based Distributed Index for Window Queries in Wireless Data Broadcast Systems

Jun-Hong Shen, Ye-In Chang
2008 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)  
In this paper, we propose a Hilbert curve-based distributed index for window queries in the wireless data broadcast systems.  ...  The window query is one of the essential spatial queries, which finds spatial objects located within a given window.  ...  Acknowledgement This research was supported in part by the National Science Council of Republic of China under Grant No.  ... 
doi:10.1109/sutc.2008.13 dblp:conf/sutc/ShenC08 fatcat:vcazm7cl2nhtdct2fqwznbl7lu

HRing: A Structured P2P Overlay Based on Harmonic Series

Hai Zhuge, Xue Chen, Xiaoping Sun, Erlin Yao
2008 IEEE Transactions on Parallel and Distributed Systems  
Routing queries achieve OðlnðnÞÞ hops. Analyses and simulations demonstrate the efficiency of query routing and the effectiveness of the long link construction method.  ...  In addition, node IDs can be any form, like number, string, address, and date, without the prerequisite of uniform distribution, so they can preserve the semantics and range locality of data objects.  ...  By making the node distribution independent of long links, it can efficiently support location-aware services such as geographically scoped multicast and geographically scoped queries.  ... 
doi:10.1109/tpds.2007.70725 fatcat:yvmq775y5bfq7ii6k2fl5kqg4q

Optimising Linked Data Queries in the Presence of Co-reference [chapter]

Xin Wang, Thanassis Tiropanis, Hugh C. Davis
2014 Lecture Notes in Computer Science  
Due to the distributed nature of Linked Data, many resources are referred to by more than one URI.  ...  Addressing co-reference in Linked Data queries, on one hand, increases complexity of query processing.  ...  Distributed Query Processing over Linked Data Query processing over Linked Data has attracted much attention in recent years.  ... 
doi:10.1007/978-3-319-07443-6_30 fatcat:sicnqsdvbrhfhnblqebax5hara

Efficient query evaluation on distributed graphs with Hadoop environment

Le-Duc Tung, Quyet Nguyen-Van, Zhenjiang Hu
2013 Proceedings of the Fourth Symposium on Information and Communication Technology - SoICT '13  
Graph has emerged as a powerful data structure to describe various data. Query evaluation on distributed graphs takes much cost due to the complexity of links among sites.  ...  Dan Suciu has proposed algorithms for query evaluation on semistructured data that is a rooted, edge-labeled graph, and algorithms are proved to be efficient in terms of communication steps and data transferring  ...  or query). • The total amount of data exchanged during communications has size of O(n 2 ) + O(r), where n denotes the number of cross-links (edges between two nodes at two different sites) in distributed  ... 
doi:10.1145/2542050.2542086 dblp:conf/soict/TungNH13 fatcat:6en74sukbvglxohfk4g5yti2cm

Linked Data and Live Querying for Enabling Support Platforms for Web Dataspaces

Jurgen Umbrich, Marcel Karnstedt, Josiane Xavier Parreira, Axel Polleres, Manfred Hauswirth
2012 2012 IEEE 28th International Conference on Data Engineering Workshops  
Enabling the "Web of Data" has recently gained increased attention, particularly driven by the success of Linked Data.  ...  Based on an empirical study, we argue that none of the two extremes on its own -centralised repositories vs. on-demand distributed querying -can meet all requirements.  ...  By today, none of the established search engines for Linked Data offers efficient structured and meta-data queries, while SPARQL endpoints (HTTP interfaces for remotely posting SPARQL queries to RDF repositories  ... 
doi:10.1109/icdew.2012.55 dblp:conf/icde/UmbrichKPPH12 fatcat:v56gcbibprdtxhemtnjembdxfa

Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets [article]

Lars Arge, David Eppstein, Michael T. Goodrich
2005 arXiv   pre-print
We present a framework for designing efficient distributed data structures for multi-dimensional data.  ...  Our framework applies to a general class of data querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi-dimensional data, such as d-dimensional octrees and  ...  a set halving lemma can be used to construct an efficient distributed data structure.  ... 
arXiv:cs/0507050v1 fatcat:p37crgzhdnaqvfzyou4ooe6mqa

Distributed content-based visual information retrieval system on peer-to-peer networks

Irwin King, Cheuk Hang Ng, Ka Cheung Sia
2004 ACM Transactions on Information Systems  
With the recent advances of distributed computing, the limitation of information retrieval from a centralized image collection can be removed by allowing distributed image data sources to interact with  ...  Specifically, we propose a Firework Query Model for distributed information retrieval, which aims to reduce the network traffic of query passing in the network.  ...  Nonetheless, FQM still obtains a gain of 20-30% in query efficiency when compared to BFS. Based on this observation, we conclude that the query efficiency of FQM is sensitive to data distribution.  ... 
doi:10.1145/1010614.1010619 fatcat:hphx5x44xbfz5dolgk7en65qlm
« Previous Showing results 1 — 15 out of 191,320 results