Sciweavers

1269 search results - page 192 / 254
» Pi-Calculus in Logical Form
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 9 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 9 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
EDBT
2006
ACM
157views Database» more  EDBT 2006»
14 years 9 months ago
Caching Complementary Space for Location-Based Services
In this paper, we propose a novel client-side, multi-granularity caching scheme, called "Complementary Space Caching" (CS caching), for location-based services in mobile ...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng, Jianl...
ICFP
2007
ACM
14 years 9 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
ICFP
2006
ACM
14 years 9 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers