Sciweavers

710 search results - page 93 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
CSFW
2003
IEEE
14 years 1 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
CP
2003
Springer
14 years 29 days ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
DBPL
2007
Springer
115views Database» more  DBPL 2007»
14 years 1 months ago
XML Publishing: Bridging Theory and Practice
Transforming relational data into XML, as known as XML publishing, is often necessary when one wants to exchange data residing in databases or to create an XML interface of a tradi...
Wenfei Fan
DMDW
2000
161views Management» more  DMDW 2000»
13 years 9 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
JSC
2010
103views more  JSC 2010»
13 years 6 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...