Sciweavers

170 search results - page 32 / 34
» Approximate Range Selection Queries in Peer-to-Peer Systems
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 5 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
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
VLDB
2002
ACM
141views Database» more  VLDB 2002»
14 years 6 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
OSDI
2008
ACM
14 years 6 months ago
R2: An Application-Level Kernel for Record and Replay
Library-based record and replay tools aim to reproduce an application's execution by recording the results of selected functions in a log and during replay returning the resu...
Zhenyu Guo, Xi Wang, Jian Tang, Xuezheng Liu, Zhil...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 6 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur