Sciweavers

164 search results - page 25 / 33
» The performance of SQL queries to an X.500 directory system
Sort
View
SOSP
2007
ACM
14 years 4 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
13 years 11 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
ICDE
2010
IEEE
221views Database» more  ICDE 2010»
13 years 7 months ago
A generic auto-provisioning framework for cloud databases
— We discuss the problem of resource provisioning for database management systems operating on top of an Infrastructure-As-A-Service (IaaS) cloud. To solve this problem, we descr...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 7 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...