Sciweavers

3686 search results - page 48 / 738
» Indexing relations on the web
Sort
View
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 12 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
BMCBI
2007
177views more  BMCBI 2007»
14 years 12 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
WWW
2008
ACM
16 years 15 days ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
WWW
2009
ACM
16 years 15 days ago
Triplify: light-weight linked data publication from relational databases
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...
Sören Auer, Sebastian Dietzold, Jens Lehmann,...
AISC
2006
Springer
15 years 3 months ago
A Search Engine for Mathematical Formulae
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
Michael Kohlhase, Ioan Sucan