708 search results - page 13 / 142 » Watermarking Relational Databases Using Optimization-Based T... |
TKDE
2011
13 years 1 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
ICDE
2009
IEEE
14 years 1 months ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
DAWAK
1999
Springer
13 years 11 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
JIIS
2000
13 years 6 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...