Sciweavers

1967 search results - page 194 / 394
» The Case for Determinism in Database Systems
Sort
View
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 6 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
ISSTA
2006
ACM
16 years 16 days ago
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
Jamieson M. Cobleigh, George S. Avrunin, Lori A. C...
QOFIS
2004
Springer
15 years 12 months ago
Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks
Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can ent...
Konstantinos Oikonomou, Ioannis Stavrakakis
CASES
2003
ACM
15 years 12 months ago
Graphical user interface energy characterization for handheld computers
A significant fraction of the software and resource usage of a modern handheld computer is devoted to its graphical user interface (GUI). Moreover, GUIs are direct users of the d...
Lin Zhong, Niraj K. Jha
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 9 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...