Sciweavers

2675 search results - page 506 / 535
» From Ontology to Relational Databases
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 2 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
POPL
2011
ACM
14 years 1 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 1 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...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 1 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
16 years 14 days ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...