Sciweavers

552 search results - page 16 / 111
» On the Complexity of Join Predicates
Sort
View
ATVA
2004
Springer
77views Hardware» more  ATVA 2004»
14 years 3 months ago
Localizing Errors in Counterexample with Iteratively Witness Searching
We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference o...
ShengYu Shen, Ying Qin, Sikun Li
CIKM
2009
Springer
14 years 2 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 10 months ago
Join Bayes Nets: A new type of Bayes net for relational data
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 10 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...