Sciweavers

1024 search results - page 188 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
DOLAP
2010
ACM
13 years 6 months ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
IPPS
2009
IEEE
14 years 3 months ago
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially execute atomic blocks using STM with optimistic c...
Nehir Sönmez, Tim Harris, Adrián Crist...
SI3D
1995
ACM
14 years 5 days ago
Real-Time Programmable Shading
One of the main techniques used by software renderers to produce stunningly realistic images is programmable shading—executing an arbitrarily complex program to compute the colo...
Anselmo Lastra, Steven Molnar, Marc Olano, Yulan W...
ICS
2009
Tsinghua U.
14 years 3 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell