Sciweavers

857 search results - page 145 / 172
» Efficient recursive XML query processing using relational da...
Sort
View
BNCOD
2003
127views Database» more  BNCOD 2003»
15 years 4 months ago
Performance Evaluation and Analysis of K-Way Join Variants for Association Rule Mining
Data mining aims at discovering important and previously unknown patterns from the dataset in the underlying database. Database mining performs mining directly on data stored in r...
P. Mishra, Sharma Chakravarthy
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 3 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 3 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
ER
2010
Springer
129views Database» more  ER 2010»
15 years 25 days ago
SQOWL: Type Inference in an RDBMS
In this paper we describe a method to perform type inference over data stored in an RDBMS, where rules over the data are specified using OWLDL. Since OWL-DL is an implementation of...
Peter McBrien, Nikos Rizopoulos, Andrew Smith
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 2 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv