Sciweavers

327 search results - page 34 / 66
» Efficiently querying rdf data in triple stores
Sort
View
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 8 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
CCS
2007
ACM
14 years 19 days ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 2 months ago
Visually Exploring and Querying XML with BaseX
Abstract: XML documents are widely used as a generic container for textual contents. As they are increasingly growing in size, XML databases have come up to efficiently store and q...
Christian Grün, Alexander Holupirek, Marc H. ...
WWW
2008
ACM
14 years 9 months ago
Automatically refining the wikipedia infobox ontology
The combined efforts of human volunteers have recently extracted numerous facts from Wikipedia, storing them as machine-harvestable object-attribute-value triples in Wikipedia inf...
Fei Wu, Daniel S. Weld
RR
2009
Springer
14 years 3 months ago
Distributed Resolution for Expressive Ontology Networks
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
Anne Schlicht, Heiner Stuckenschmidt