Sciweavers

765 search results - page 58 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 2 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
189
Voted
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
15 years 11 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
DNIS
2010
Springer
240views Database» more  DNIS 2010»
15 years 1 months ago
AccKW: An Efficient Access Control Scheme for Keyword-Based Search over RDBMS
Access control for relational databases is a well researched area. An SQL query is allowed or denied access to database according to the specified access control policy. On the oth...
Vikram Goyal, Ashish Sureka, Sangeeta Lal
PVLDB
2010
174views more  PVLDB 2010»
14 years 8 months ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 17 days ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor