Filters








17 Hits in 7.6 sec

Benchmarking Fulltext Search Performance of RDF Stores [chapter]

Enrico Minack, Wolf Siberski, Wolfgang Nejdl
2009 Lecture Notes in Computer Science  
In this paper, we extend the LUBM benchmark with synthetic scalable fulltext data and corresponding queries for fulltext-related query performance evaluation.  ...  Results show interesting RDF store insights for basic fulltext queries (classic IR queries) as well as hybrid queries (structured and fulltext queries).  ...  These queries show the quality of integration of IR features with general SPARQL query processing.  ... 
doi:10.1007/978-3-642-02121-3_10 fatcat:downxate2zdvzmvlyo5k735qf4

SPAR-Key: Processing SPARQL-Fulltext Queries to Solve Jeopardy! Clues

Arunav Mishra, Sairam Gurajada, Martin Theobald
2013 Conference and Labs of the Evaluation Forum  
We describe our SPAR-Key query engine that implements indexing, ranking, and query processing techniques to run a new kind of SPARQL-fulltext queries that were provided in the context of the INEX 2013  ...  For a fulltext condition, SPAR-Key Ultimatum performs an additional look-up on the URI index and then performs an OUTER join with the results of a fulltext search on the article content.  ...  Our approach converts a SPARQL query with fulltext conditions into unions of conjunctive SQL queries by materializing temporary tables.  ... 
dblp:conf/clef/MishraGT13 fatcat:qlvb7homnvcvreb3luof2ge2j4

Re-using Cool URIs: Entity Reconciliation Against LOD Hubs

Fadi Maali, Richard Cyganiak, Vassilios Peristeras
2011 The Web Conference  
We evaluate four approaches using the OAEI Instance Matching Benchmark, and describe their implementation in an extension to the popular data workbench application Google Refine.  ...  They provide well-managed reference identifiers that attract a large share of the incoming links on the Web of Data and play a crucial role in data integration within communities of interest.  ...  LARQ (SPARQL with fulltext search) queries are then used to find the matching resource.  ... 
dblp:conf/www/MaaliCP11 fatcat:s7qlr245a5f6tcx6a6kptjmpsi

Broccoli: Semantic Full-Text Search at your Fingertips [article]

Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haussmann
2013 arXiv   pre-print
We evaluated query times and result quality on the full version of the English Wikipedia (40 GB XML dump) combined with the YAGO ontology (26 million facts).  ...  We present Broccoli, a fast and easy-to-use search engine for what we call semantic full-text search.  ...  Acknowledgments This work is partially supported by the DFG priority program Algorithm Engineering (SPP 1307) and by the German National Library of Medicine (ZB MED).  ... 
arXiv:1207.2615v3 fatcat:bru4imfcujag7o3vddxacajcwq

Searching Web Data: An Entity Retrieval and High-Performance Indexing Model

Renaud Delbru, Stephane Campinas, Giovanni Tummarello
2012 Social Science Research Network  
We introduce an indexing methodology for semi-structured data which offers a good compromise between query expressiveness, query processing and index maintenance compared to other approaches.  ...  This calls for large scale systems providing effective means of searching and retrieving this semi-structured information with the ultimate goal of making it exploitable by humans and machines alike.  ...  The design of the value and attribute query benchmarks includes three factors: Each condition of the design, e.g., AFOR-1 / 2-AND / WIKIPEDIA, contains 100 separate measurements.  ... 
doi:10.2139/ssrn.3198931 fatcat:mimvtyqbkbhaniijpxrl3wqu2i

Searching web data: An entity retrieval and high-performance indexing model

Renaud Delbru, Stephane Campinas, Giovanni Tummarello
2012 Journal of Web Semantics  
We introduce an indexing methodology for semi-structured data which offers a good compromise between query expressiveness, query processing and index maintenance compared to other approaches.  ...  This calls for large scale systems providing effective means of searching and retrieving this semi-structured information with the ultimate goal of making it exploitable by humans and machines alike.  ...  The design of the value and attribute query benchmarks includes three factors: Each condition of the design, e.g., AFOR-1 / 2-AND / WIKIPEDIA, contains 100 separate measurements.  ... 
doi:10.1016/j.websem.2011.04.004 fatcat:ts4tyui34nf7ldub2l7tcavdpy

The Role of a Computational Lexicon for Query Expansion in Full-Text Search

Emiliano Giovannetti, Davide Albanesi, Andrea Bellandi, Simone Marchi, Mafalda Papini, Flavia Sciolette
2021 Italian Conference on Computational Linguistics  
This work describes the first experiments conducted with a computational lexicon of Italian in a context of query expansion for full-text search.  ...  An application, composed of a graphical user interface and backend services to access the lexicon and the database containing the corpus to be queried, was developed.  ...  Acknowledgments This work was conducted in the context of the TALMUD project and the scientific cooperation between S.c.a r.l. PTTB and ILC-CNR.  ... 
dblp:conf/clic-it/GiovannettiABMP21 fatcat:27b3n6elnfhoxcz4k46osjgita

Emerging, Collective Intelligence for Personal, Organisational and Social Use [chapter]

Sotiris Diplaris, Andreas Sonnenbichler, Tomasz Kaczanowski, Phivos Mylonas, Ansgar Scherp, Maciej Janik, Symeon Papadopoulos, Michael Ovelgoenne, Yiannis Kompatsiaris
2011 Studies in Computational Intelligence  
In [19] tags and visual information together with geo-location are used for objects (e.g. monuments) and events extraction.  ...  The section also includes user evaluation results for the developed demonstrators.  ...  The first proof of concept (implemented using a fixed set of queries from the Berlin SPARQL benchmark 12 ) is very promising, but the whole idea still needs a lot of polishing.  ... 
doi:10.1007/978-3-642-20344-2_20 fatcat:crgix2grbvfupaht5mp3cjriii

On construction, performance, and diversification for structured queries on the semantic desktop [article]

Enrico Minack, University, My
2019
Acknowledgements This work would not have been possible without the support and con-  ...  Its performance is of interest, since in the more complex benchmark queries the evaluation of keyword query conditions produces equivalent intermediate result sets with a proportional performance and scalability  ...  Semantic IR Performance The following queries contain structural conditions to investigate their impact on the query evaluation performance.  ... 
doi:10.15488/7704 fatcat:355luhx2anb2xdj2n2wlhghce4

Dagstuhl Reports, Volume 7, Issue 6, June 2017, Complete Issue [article]

2018
The goal is to answer queries in terms of the target ontology in a federated manner. From a practical point of view, this begs the question: where does the target ontology and the mappings come from?  ...  Tran Cao Son, Enrico Pontelli, Chitta Baral, and Gregory Gelfond. Exploring the kd45 property of a kripke model after the execution of an action sequence. In AAAI, pages 1604-1610, 2015.  ...  and optimization techniques for federated query engines, the definition and the implementation of benchmarks for evaluating and comparing FSDM systems, the elaboration of guidelines for choosing solutions  ... 
doi:10.4230/dagrep.7.6 fatcat:5ovvse5smzhxppthq2tu6i4icm

A new Nested Graph Model for Data Integration

Giacomo Bergami
2018
All the aforementioned conditions do not degrade the query evaluations. Table 4 .2 represents the result of such benchmarks.  ...  ., no HTTP), all the aforementioned conditions do not degrade the query evaluations.  ...  Each morphism f j returned from the match of BN ′ with H will have as many keys as the vertices and edges in H.  ... 
doi:10.6092/unibo/amsdottorato/8348 fatcat:4tfvtyhvhngejolqpooseqrkqu

Concepts and tools for the effective and efficient use of web archives [article]

Helge Holzmann, University, My, University, My
2019
Web archives constitute valuable sources for researchers in various disciplines. However, their sheer size, the typically broad scope and their temporal dimension make them difficult to work with.  ...  We address both angles: 1. by presenting a retrospective analysis of crawl metadata on the size, age and growth of a Web dataset, 2. by proposing a programming framework for efficiently processing archival  ...  Details on the design and architecture of ArchiveSpark are described and evaluated in Section 3.2.  ... 
doi:10.15488/4436 fatcat:rgjuppdyjrea7jqhifxfzdvy6m

Exploiting metadata for context creation and ranking on the desktop [article]

Stefania Costache, University, My
2019
querying with Beagle and Beagle ++ Table 2 .5 2 Number of hits provided by Beagle and Beagle ++ for one query response time for these queries increased from an average of 0.348 seconds for Beagle, to  ...  On average, for every issued query, a subject had to evaluate about 20 documents, for an average dimension of the desktop data of about 7.500 documents.  ...  Also, for the distributed enviroment, in future work we will extend these algorithms with methods to estimate the potential of peers to influence results of other peers, and come up with incremental update  ... 
doi:10.15488/7375 fatcat:zlfza73345dcbfw6hvln5oonna

ICIW 2013 Committee ICIW Advisory Committee ICIW 2013 Technical Program Committee

Marek Rychly, Steffen Fries, Vagan Terziyan, Steffen Fries, Vagan Terziyan, Charlie Abela, Markus Aleksy, Giner Alor Hernandez, Instituto Tecnologico De Orizaba -Veracruz, México Feda, Alshahwan, Liliana Ardissono (+122 others)
unpublished
They focused on Web technologies, design and development of Web-based applications, and interactions of these applications with other types of systems.  ...  Evaluation techniques and standard position on different aspects were part of the expected agenda.  ...  Keigo Utsunomiya for his advice relating to humanities research and the significance of personal or small-scale document management.  ... 
fatcat:ggddvybjpje6nft4fkf6mihbh4

Proceedings of the 6th International Symposium on Semantic Mining in Biomedicine (SMBM 2014)

S.N.
2014
We would also like to thank Artem Khojoyan for his help with Liferay development.  ...  Acknowledgements We would like to thank Drs Tania Tudorache, Natasha Noy, and Matthew Horridge of Stanford University's Department of Biomedical Informatics for their valuable guidance in using the OWL  ...  Data Mining and Analysis In RDF, all the stored triples are accessible using a common query language, SPARQL (SPARQL Protocol and RDF Query Language) 16 .  ... 
doi:10.5167/uzh-98982 fatcat:avtlvr27hrdyfjfto47x2lfulu
« Previous Showing results 1 — 15 out of 17 results