Sciweavers

342 search results - page 41 / 69
» Conjunctive Queries over Trees
Sort
View
AIRS
2006
Springer
13 years 11 months ago
Automatic Query Type Identification Based on Click Through Information
We report on a study that was undertaken to better identify users' goals behind web search queries by using click through data. Based on user logs which contain over 80 millio...
Yiqun Liu, Min Zhang, Liyun Ru, Shaoping Ma
SAC
2006
ACM
14 years 1 months ago
Ontology-based integration for relational databases
In this paper, we show that representation and reasoning techniques used in traditional knowledge engineering and the emerging Semantic Web can play an important role for heteroge...
Dejing Dou, Paea LePendu
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...
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