Sciweavers

2514 search results - page 54 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 6 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
16 years 20 days ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
CIS
2004
Springer
15 years 11 months ago
Fast Query Over Encrypted Character Data in Database
There are a lot of very important data in database, which need to be protected from attacking. Cryptographic support is an important mechanism of securing them. People, however, mu...
Zheng-Fei Wang, Jing Dai, Wei Wang 0009, Baile Shi
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 6 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...