Sciweavers

768 search results - page 25 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 1 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
DIS
2004
Springer
15 years 3 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...
SPIRE
2005
Springer
15 years 5 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
ICIP
2005
IEEE
15 years 5 months ago
Fingerprint indexing based on singular point correlation
—Fingerprint indexing is an efficient technique that greatly improves the performance of Automated Fingerprint Identification Systems. We propose a continuous fingerprint indexin...
Tong Liu, Guocai Zhu, Chao Zhang, Pengwei Hao
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
15 years 11 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou