Sciweavers

186 search results - page 29 / 38
» Processing Sequential Patterns in Relational Databases
Sort
View
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 9 months ago
Discovering Conditional Functional Dependencies
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
Wenfei Fan, Floris Geerts, Laks V. S. Lakshmanan, ...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 7 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
EDBTW
2010
Springer
14 years 2 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
KDD
1994
ACM
96views Data Mining» more  KDD 1994»
13 years 11 months ago
DICE: A Discovery Environment Integrating Inductive Bias
: Most of Knowledge Discovery in Database (KDD) systems are integrating efficient Machine Learning techniques. In fact issues in Machine Learning and KDD are very close allowing fo...
Jean-Daniel Zucker, Vincent Corruble, J. Thomas, G...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 1 days ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer