Sciweavers

1418 search results - page 15 / 284
» Schema polynomials and applications
Sort
View
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 4 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
DOOD
1995
Springer
128views Database» more  DOOD 1995»
13 years 11 months ago
Authorization Analysis of Queries in Object-Oriented Databases
Abstract. A simple model for method-based authorization is defined and an algorithm is presented for testing in compile-time whether a given database schema violates authorization...
Hiroyuki Seki, Yasunori Ishihara, Minoru Ito
CLUSTER
2004
IEEE
13 years 11 months ago
A distributed data management middleware for data-driven application systems
A key challenge in supporting data-driven scientific applications is the storage and management of input and output data in a distributed environment. In this paper, we describe a...
Stephen Langella, Shannon Hastings, Scott Oster, T...
SIAMDM
2010
101views more  SIAMDM 2010»
13 years 2 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
WISE
2005
Springer
14 years 28 days ago
Constructing Interface Schemas for Search Interfaces of Web Databases
Many databases have become Web-accessible through form-based search interfaces (i.e., search forms) that allow users to specify complex and precise queries to access the underlying...
Hai He, Weiyi Meng, Clement T. Yu, Zonghuan Wu