Sciweavers

2514 search results - page 83 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDT
2007
ACM
87views Database» more  ICDT 2007»
16 years 15 days ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
ICDCS
2009
IEEE
15 years 4 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
PODS
2003
ACM
135views Database» more  PODS 2003»
16 years 6 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
15 years 12 months ago
Efficient Hardware Search Engine for Associative Content Retrieval of Long Queries in Huge Multimedia Databases
Due to the enormous increase in the stored digital contents, search and retrieval functionalities are necessary in multimedia systems. Though processor speed for standard PCs (Per...
Christophe Layer, Hans-Jörg Pfleiderer
ERCIMDL
2005
Springer
124views Education» more  ERCIMDL 2005»
15 years 12 months ago
A Comparison of On-Line Computer Science Citation Databases
This paper examines the difference and similarities between the two on-line computer science citation databases DBLP and CiteSeer. The database entries in DBLP are inserted manual...
Vaclav Petricek, Ingemar J. Cox, Hui Han, Isaac G....