Sciweavers

189 search results - page 12 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
ASUNAM
2011
IEEE
12 years 8 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 3 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
ADC
2008
Springer
146views Database» more  ADC 2008»
14 years 3 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
DEXA
2009
Springer
167views Database» more  DEXA 2009»
14 years 3 months ago
Analyses and Validation of Conditional Dependencies with Built-in Predicates
Abstract. This paper proposes a natural extension of conditional functional dependencies (cfds [14]) and conditional inclusion dependencies (cinds [8]), denoted by cfdp s and cindp...
Wenguang Chen, Wenfei Fan, Shuai Ma
ICDT
2011
ACM
242views Database» more  ICDT 2011»
13 years 2 days ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu