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...
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
In this paper we discuss two data models for spatial database systems: the linear data model and the topological data model. Both can be used to model a wide range of applications....
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...