Filters








28,865 Hits in 4.2 sec

Scalable distributed indexing and query processing over Linked Data

Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswirth
2012 Journal of Web Semantics  
A number of e cient local RDF stores exist already, while distributed indexing and distributed query processing over Linked Data with similar e ciency and data management features as known from traditional  ...  scalable query processing over distributed Linked Data sources, taking into account the latest advances in database technology.  ...  Scalability in this way can be best achieved by scaling out, i.e., adding more nodes to the system, partitioning the data and distributing the computation / query processing over the nodes.  ... 
doi:10.1016/j.websem.2011.11.010 fatcat:4fpikppnz5gbrk23rtcf5robuy

Scalable Distributed Indexing and Query Processing Over Linked Data

Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswirth
2012 Social Science Research Network  
and scalable query processing over distributed Linked Data sources, taking into account the latest advances in database technology.  ...  A number of efficient local RDF stores exist already, while distributed indexing and distributed query processing over Linked Data with similar efficiency and data management features as known from traditional  ...  Scalability in this way can be best achieved by scaling out, i.e., adding more nodes to the system, partitioning the data and distributing the computation / query processing over the nodes.  ... 
doi:10.2139/ssrn.3198930 fatcat:k6ilnvk2fffzdgc2mhpryahoju

Scalable integration and processing of linked data

Andreas Harth, Aidan Hogan, Spyros Kotoulas, Jacopo Urbani
2011 Proceedings of the 20th international conference companion on World wide web - WWW '11  
As such, the tutorial will focus on Linked Data publishing and related Semantic Web technologies, introducing scalable techniques for crawling, indexing and automatically integrating structured heterogeneous  ...  The tutorial will show how Linked Data enables uniform access, parsing and interpretation of data, and how this novel wealth of structured data can potentially be exploited for creating new applications  ...  Scalable RDF Indexing Techniques This session presents scalable techniques for indexing and querying local repositories of Linked Data.  ... 
doi:10.1145/1963192.1963318 dblp:conf/www/HarthHKU11 fatcat:63pzk35ga5b4hegnyf3dcmd2ey

A framework for the massive knowledge Web

Xiaoping Sun, Hai Zhuge, Qing Li
2009 Concurrency and Computation  
Three major components are discussed herein: (1) semantic data model for massive Web2.0 content, (2) semantics-rich query model, and (3) scalable distributed semantic indexing model.  ...  The architecture incorporates a virtual P2P overlay into the server side platform to support efficient knowledge management, semantics-rich and personalized query processing for huge amounts of dynamic  ...  To support efficient and scalable query processing, a semantic index is built over the semantic overlay based on the hierarchical clusters of the published semantic objects.  ... 
doi:10.1002/cpe.1372 fatcat:sqz3cb4lujdejjvu4eefr3micu

Querying Heterogeneous Datasets on the Linked Data Web: Challenges, Approaches, and Trends

Andre Freitas, Edward Curry, Joao Gabriel Oliveira, Sean O'Riain
2012 IEEE Internet Computing  
We thank the reviewers and editors for their careful and valuable feedback.  ...  over linked data.  ...  . 4 The system architecture's main components include query processing, ranking, an index manager, and an internal data store (YARS2), which focuses on scalability issues to enable federated queries  ... 
doi:10.1109/mic.2011.141 fatcat:kovzfmfjvfhpdeavhxcb3pueba

MINERVA∞: A Scalable Efficient Peer-to-Peer Search Engine [chapter]

Sebastian Michel, Peter Triantafillou, Gerhard Weikum
2005 Lecture Notes in Computer Science  
time, and replication algorithms for expediting top-k query processing.  ...  We have implemented the proposed architecture and we report on our extensive experiments with real-world, web-crawled, and synthetic data and queries, showcasing the scalability and efficiency traits of  ...  The relevant algorithms of MINERVA∞ ensure high degrees of distribution for index lists' data and distributed processing, avoiding central bottlenecks and boosting scalability.  ... 
doi:10.1007/11587552_4 fatcat:jnu3esmulncadegol3tbioobja

ICDE conference 2014 detailed author index

2014 2014 IEEE 30th International Conference on Data Engineering  
Tamer 40 R-Store: A Scalable Distributed System for Supporting Real-Time Analytics 1286 Linked Data Query Processing [Search] A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ICDE Conference  ...  Ramamritham, Krithi 1306 Distributed Execution of Continuous Queries Rao, Praveen 1270 A Tool for Internet-Scale Cardinality Estimation of XPath Queries Over Distributed Semistructured Data  ... 
doi:10.1109/icde.2014.6816627 fatcat:bmnfkwqucfcmhet64s2o6ns5ky

Elastic and Scalable Processing of Linked Stream Data in the Cloud [chapter]

Danh Le-Phuoc, Hoan Nguyen Mau Quoc, Chan Le Van, Manfred Hauswirth
2013 Lecture Notes in Computer Science  
Several Linked Stream Data processing engines exist but their scalability still needs to be in improved in terms of (static and dynamic) data sizes, number of concurrent queries, stream update frequencies  ...  To remedy these limitations, this paper presents an approach for elastically parallelizing the continuous execution of queries over Linked Stream Data.  ...  Therefore, distributing the processing load of a Linked Stream Data processing engine over networked computers is a promising strategy to achieve scalability.  ... 
doi:10.1007/978-3-642-41335-3_18 fatcat:w4ogqbov6ffctm3lp6hrsdfwja

Special issue on querying the data web

Paolo Ceravolo, Chengfei Liu, Mustafa Jarrar, Kai-Uwe Sattler
2011 World wide web (Bussum)  
On the other side, traditional structured querying languages cannot be used directly as data on the Data Web is heterogeneous, large, distributed, schema-free, and not intuitive for web users.  ...  To expose the massive amount of structured data on the Web to its full potential, people should be able to query and combine this data easily and effectively.  ...  ., "Comparing Data Summaries for Processing Live Queries over Linked Data", addresses the problem of querying Linked Data distributed over multiple sources.  ... 
doi:10.1007/s11280-011-0139-z fatcat:73bpqsnpvfcbhlvlzup3mc34iu

High-performance, massively scalable distributed systems using the MapReduce software framework

Kurt Rohloff, Richard E. Schantz
2010 Programming Support Innovations for Emerging Distributed Applications on - PSI EtA '10  
We provide a general approach to construct an information system from the MapReduce software framework that responds to data queries.  ...  We discuss several design considerations associated with constructing complex distributed systems using the MapReduce software framework, including the difficulty of scalably building indexes.  ...  ACKNOWLEDGMENTS The authors would like to thank Gail Mitchell, Doug Reid and Prakash Manghwani from BBN, Philip Zeyliger from Cloudera and Hanspeter Pfister from Harvard University for their assistance  ... 
doi:10.1145/1940747.1940751 dblp:conf/oopsla/RohloffS10 fatcat:p477du7uofavnf6srzd4kwr5pi

Querying and Searching Heterogeneous Knowledge Graphs in Real-time Linked Dataspaces [chapter]

André Freitas, Seán O'Riáin, Edward Curry
2019 Real-time Linked Dataspaces  
Section 7.3 introduces search and query over dataspaces, discusses the challenges with data heterogeneity in a dataspace, and identifies the core requirement for the search and query service.  ...  Introduction As the volume and variety of data sources within a dataspace grow, it becomes a semantically heterogeneous and distributed environment; this presents a significant challenge to querying the  ...  The system architecture's main components include query processing, ranking, an index manager, and an internal data store (YARS2), which focuses on scalability issues to enable federated queries over linked  ... 
doi:10.1007/978-3-030-29665-0_7 fatcat:7qb2boh7njgvjiknknaaig5cou

CIDACS-RL: a novel indexing search and scoring-based record linkage system for huge datasets with high accuracy and scalability

George C. G. Barbosa, M. Sanni Ali, Bruno Araujo, Sandra Reis, Samila Sena, Maria Y. T. Ichihara, Julia Pescarini, Rosemeire L. Fiaccone, Leila D. Amorim, Robespierre Pita, Marcos E. Barreto, Liam Smeeth (+1 others)
2020 BMC Medical Informatics and Decision Making  
Methods We developed CIDACS-RL (Centre for Data and Knowledge Integration for Health – Record Linkage), a novel iterative deterministic record linkage algorithm based on a combination of indexing search  ...  with reasonable accuracy and scalability is required.  ...  Authors' contributions GCGB and MSA wrote the first draft of the manuscript with contributions from RP, MEB and all other co-authors. GCGB, MSA, RP, BA and MEB discussed  ... 
doi:10.1186/s12911-020-01285-w pmid:33167998 fatcat:skcuhribsvautjjml2izdttkvi

Clause-iteration with MapReduce to scalably query datagraphs in the SHARD graph-store

Kurt Rohloff, Richard E. Schantz
2011 Proceedings of the fourth international workshop on Data-intensive distributed computing - DIDC '11  
We present algorithms that, when used in conjunction with a MapReduce framework, respond to SPARQL queries over RDF data.  ...  We present a scalable cloud-based approach to process queries on graph data utilizing the MapReduce model. We call this approach the Clause-Iteration approach.  ...  We implement the Clause-Iteration algorithms for SPARQL queries over RDF data in the SHARD (Scalable, High-Performance, Robust and Distributed) graph-store [37] .  ... 
doi:10.1145/1996014.1996021 dblp:conf/hpdc/RohloffS11 fatcat:kdxufwpnbrbtnnrce7suz6q4bu

Scalable text retrieval for large digital libraries [chapter]

David Hawking
1997 Lecture Notes in Computer Science  
A non-replicated 20 gigabyte collection was indexed in just over 5 hours using a ten workstation cluster and scalability results are presented for query processing over replicated collections of up to  ...  Query-processing eciency on a single workstation is shown to deteriorate dramatically when data size is increased above a certain multiple of physical memory size.  ...  National Institute of Standards and Technology and various copyright holders for access to the TREC data collection.  ... 
doi:10.1007/bfb0026726 fatcat:c72is7int5dolj2q63n7ruqwx4

Towards a scalable search and query engine for the web

Aidan Hogan, Andreas Harth, Jürgen Umrich, Stefan Decker
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
We present a search engine that uses the RDF data model to enable interactive query answering over richly structured and interlinked data collected from many disparate sources on the Web.  ...  Current search engines do not fully leverage semantically rich datasets, or specialise in indexing just one domainspecific dataset.  ...  The user interface, which is supported by a scalable and distributable index structure, provides novel ways of exploring a graph-based dataset, including incremental query formulation.  ... 
doi:10.1145/1242572.1242819 dblp:conf/www/HoganHUD07 fatcat:335wwuap45ehjoffqmbl53xtaa
« Previous Showing results 1 — 15 out of 28,865 results