Sciweavers

119 search results - page 9 / 24
» MiniCon: A scalable algorithm for answering queries using vi...
Sort
View
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
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 9 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
CASCON
2001
148views Education» more  CASCON 2001»
13 years 9 months ago
A Pareto model for OLAP view size estimation
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
Thomas P. Nadeau, Toby J. Teorey
AI
2010
Springer
13 years 7 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 25 days ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo