A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
queries over Linked Data on the Web exploiting the source summary, and evaluate the system using synthetically generated queries. ... An ideal query answering system for Linked Data should return current answers in a reasonable amount of time, even on corpora as large as the Web. ... In summary, the proposed approach represents a novel, efficient and effective way of supporting source selection for live queries over the Linked Data Web. ...doi:10.1145/1772690.1772733 dblp:conf/www/HarthHKPSU10 fatcat:qtbmh2ypnvemho2qsi5kxa2oqm
The rapid growth of structured data on the Web has created a high demand for making this content more reusable and consumable. ... 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. ... The second paper by Umbrich et al., "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
Semantic Web Journal
The special issue compiles three technical contributions that significantly advance the state-of-the-art in exploration of semantic data using semantic web techniques and technologies. ... For this reason, there is a need for systems that can produce on-demand rewritings of queries. ... It is common practice to query different linked datasets in order to get as much information as possible on distinct topics. ...doi:10.3233/sw-190350 fatcat:pa6fu2amwbamfko5x242ut37z4
Therefore, the authors introduce a discovery approach for Linked Data interfaces based on hypermedia links and controls, and apply it to federated query execution with Triple Pattern Fragments. ... Evaluating federated Linked Data queries requires consulting multiple sources on the Web. Before a client can execute queries, it must discover data sources, and determine which ones are relevant. ... Umbrich et al. (2011) published an extensive report on data summaries for live Linked Data querying. ...doi:10.4018/ijswis.2016070103 fatcat:qjranyonpfhmnmywghl367a7zm
Since personal data in these decentralised ecosystems are distributed across many sources, there is a need for techniques to support efficient privacy-preserving query execution over personal data stores ... Existing decentralised Web-based ecosystems, such as Solid, aim to combat personal data exploitation on the Web by enabling individuals to manage their data in the personal data store of their choice. ... Pods could generate these summaries lazily on demand, periodically or upon file changes. Following the approach from Vander Sande et al. ...arXiv:2008.06265v1 fatcat:xqoboww3ibghhhted3bmbn4nuq
Many data scientists make use of Linked Open Data (LOD) as a huge interconnected knowledge base represented in RDF. ... For these use cases LOD-a-lot signi cantly reduces the cost and complexity of conducting Data Science. ... An additional index le of 220GB, which further optimizes querying  , can be created on demand. e memory footprint required for exposing LOD-alot through an online endpoint, or for querying it locally ...doi:10.1145/3132218.3132241 dblp:conf/i-semantics/BeekFV17 fatcat:3vl3smlzsrfzpaihuyomvhpmvi
Lecture Notes in Computer Science
We then propose a method to create various summary databases from the main database available at server side, on the basis of these query patterns. ... Processing queries under this scenario is challenging because we need to organize the broadcast data to efficiently process queries of an average mobile client. ... A client will be interested in some data items for which he/she would like to place a demand. ...doi:10.1007/11947950_37 fatcat:wtmwke4k4rfuvg3dp4xvimionq
Owing to immense memory demands one cannot first calculate P explicitly and then compute its marginal by “summing over remaining variables”. ... Summary: “We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided. ...
Keyword search is an intuitive paradigm for searching linked data sources on the web. ... We propose a novel method for computing top-k routing plans based on their potentials to contain results for a given keyword query. ... Keyword Query Routing We propose to investigate the problem of keyword query routing for keyword search over large number of structured and Linked Data sources. ...doi:10.18535/etj/v2i1.01 fatcat:sp4t3xqla5dwhocz57zzl4szde
This project aims at integrating the popular Dream.3D software for materials science research into Bisque, thus enabling sharing of data and methods, and collaborative research on large scale datasets. ... BisQue (Bio Semantic Query User Environment) is a cloud-based analysis platform developed in the Center for Bio-Image Informatics at UCSB. ... the web browser (data fetch on demand) ...doi:10.6084/m9.figshare.4652710 fatcat:gm5mcooorbcolhz77iziu2ng2q
Signals and Communication Technology
The system employs automatic story segmentation, and displays the results of text and image-based queries in ranked sets of story summaries. ... In many cases, it is not sufficient to search for relevant videos, but rather to identify relevant clips, typically less than one minute in length, within the videos. ... Detail-on-demand Video We use detail-on-demand video as a representation for an interactive multilevel video summary. ...doi:10.1007/978-3-540-33215-2_10 fatcat:vdgjxvw5ujhxjdfsb6bat7bkvy
Journal of Public Health Management and Practice
In response to this data demand CHART designed and implemented a dial-up system for communities to access data. ... The resulting tables can be downloaded to Excel for further summary, analysis, graphing and presentation. ...
In our framework, a demand for data flow information is modeled as a set of data flow queries. ... The derived demand-driven algorithms find responses to these queries through a partial reversal of the respective data flow analysis. ... Acknowledgements We thank Tom Reps and the referees for their comments on an earlier draft of this paper. ...doi:10.1145/199448.199461 dblp:conf/popl/DuesterwaldGS95 fatcat:hkdu2kkfpbbihfcviiu3cxpohq
Information on 129 patient encounters from 37 unique sites has been entered. A full client-server system has been designed. ... Benchmarks show that while the relative performance of a communication link based upon a phone line is 0.07 to 0.15 that of a local area network, optimization permits adequate response. ... Special thanks to Dyan Blewett, Judy Piggins, Mitch Feldman, and Laurie Hassan for their assistance, and to Dr. Robert Jenders for his editorial comments. ...doi:10.1136/jamia.1994.95236148 pmid:7719799 pmcid:PMC116196 fatcat:psb7ky5xjvgwxckbdwpz5v7bnq
In this paper we focus primarily on the problem of query processing, specifically on how to define and evaluate continuous queries over data streams. ... First, we specify a general and flexible architecture for query processing in the presence of data streams. ... Acknowledgements We are grateful to Jose Blakeley for excellent comments on an initial draft, and to the entire STREAM group at Stanford for many inspiring discussions. ...doi:10.1145/603867.603884 fatcat:6ix4y2aym5dppjzpuhg5kxj4bq
« Previous Showing results 1 — 15 out of 72,072 results