Sciweavers

2889 search results - page 6 / 578
» Querying Structured Hyperdocuments
Sort
View
NAACL
2010
13 years 5 months ago
Clinical Information Retrieval using Document and PICO Structure
In evidence-based medicine, clinical questions involve four aspects: Patient/Problem (P), Intervention (I), Comparison (C) and Outcome (O), known as PICO elements. In this paper w...
Florian Boudin, Jian-Yun Nie, Martin Dawes
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 9 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
DBISP2P
2005
Springer
132views Database» more  DBISP2P 2005»
13 years 9 months ago
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
Erietta Liarou, Stratos Idreos, Manolis Koubarakis
SIGIR
2012
ACM
11 years 10 months ago
Automatic term mismatch diagnosis for selective query expansion
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
Le Zhao, Jamie Callan
DATESO
2009
101views Database» more  DATESO 2009»
13 years 5 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar