Sciweavers

893 search results - page 72 / 179
» Commit processing in distributed real-time database systems
Sort
View
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 5 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
MOBIDE
2005
ACM
15 years 8 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
CIKM
2005
Springer
15 years 8 months ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
HPTS
1993
147views Database» more  HPTS 1993»
15 years 7 months ago
Generic Action Support for Distributed, Cooperative Applications
Elements of transaction processing become more and more accepted as a base for general purpose distributed computing.We have developed an action concept with an extended functiona...
Edgar Nett, Michael Mock
ADC
2006
Springer
110views Database» more  ADC 2006»
15 years 6 months ago
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
The quality of database distribution design, which involves fragmentation and allocation, should be assessed by the performance of a system. In particular, this applies to non-rel...
Hui Ma, Klaus-Dieter Schewe, Qing Wang