Sciweavers

711 search results - page 57 / 143
» Revisiting Commit Processing in Distributed Database Systems
Sort
View
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 7 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein
INFOCOM
2006
IEEE
14 years 1 months ago
SmartSeer: Using a DHT to Process Continuous Queries Over Peer-to-Peer Networks
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
EUROPAR
2001
Springer
14 years 8 days ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
DSN
2002
IEEE
14 years 22 days ago
A Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ISCI
2000
80views more  ISCI 2000»
13 years 7 months ago
Quantum associative memory with distributed queries
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
A. A. Ezhov, A. V. Nifanova, Dan Ventura