[PDF][PDF] Incomplete object—a data model for design and planning applications
T Imielinski, S Naqvi, K Vadaparty - Proceedings of the 1991 ACM …, 1991 - dl.acm.org
T Imielinski, S Naqvi, K Vadaparty
Proceedings of the 1991 ACM SIGMOD international conference on Management of …, 1991•dl.acm.orgWe are motivated by applications within design, planning and scheduling areas, where
current research appears to be focused on syntactic issues of performance and volume. We
take a more semantic view of applications within these areas and discover several useful
functionalities that are poorly supported. For example, facilities for handling incomplete
specifications are quite inadequate. We introduce a notion of OR.-objects and show that it
captures incomplete specifications naturally. In particular, a database with OR-objects …
current research appears to be focused on syntactic issues of performance and volume. We
take a more semantic view of applications within these areas and discover several useful
functionalities that are poorly supported. For example, facilities for handling incomplete
specifications are quite inadequate. We introduce a notion of OR.-objects and show that it
captures incomplete specifications naturally. In particular, a database with OR-objects …
Abstract
We are motivated by applications within design, planning and scheduling areas, where current research appears to be focused on syntactic issues of performance and volume. We take a more semantic view of applications within these areas and discover several useful functionalities that are poorly supported. For example, facilities for handling incomplete specifications are quite inadequate. We introduce a notion of OR.-objects and show that it captures incomplete specifications naturally. In particular, a database with OR-objects represents a set of possible worlds, eg, a world for each design or schedule, and queries can either be evaluated in the “interpretations” of the database, or in the database itself. We formalize these notions of interpretations and hypothetical queries in an object-oriented setting, and provide a complexity characterization for our queries.