Sciweavers

66 search results - page 8 / 14
» Conjunctive Query Containment over Trees
Sort
View
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
13 years 5 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
FOSSACS
2009
Springer
14 years 2 months ago
Separating Graph Logic from MSO
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
Timos Antonopoulos, Anuj Dawar
TALG
2010
110views more  TALG 2010»
13 years 6 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
DOCENG
2004
ACM
14 years 1 months ago
Presenting the results of relevance-oriented search over XML documents
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
Alda Lopes Gançarski, Pedro Rangel Henrique...
COMAD
2008
13 years 9 months ago
Concurrency Control in Distributed MRA Index Structure
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
Neha Singh, S. Sudarshan