ttoneyman, P., Ladner, R.E., Yannakakis, M. Testing the Universal Instance Assumption. Information Processing Letters I0, 1 (1980), 14-19. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Equational Theories and Database Constraints - Cosmadakis (1983) (4 citations) (Correct)
....In practice this is not always the case, so one has the problem of testing the existence of a universal instance and the problem of adjusting the database relations to maintain the existence of a universal instance as the database is updated. Both of these problems are known to be NP complete [39]. An alternative, weaker condition we may impose on a multi relational database is pairwise consislency, i.e. every pair of the database relations is required to have a universal relation. This condition is easy to test and maintain, as described in l0 numerous works on the subject (see [8] fi)r ....
ttoneyman, P., Ladner, R.E., Yannakakis, M. Testing the Universal Instance Assumption. Information Processing Letters I0, 1 (1980), 14-19.
On the Representation and Querying of Sets of Possible.. - Abiteboul, Kanellakis.. (1989) (38 citations) (Correct)
....pursue here) is to let the query program size be part of the input size. Then the complexity of evaluation increases exponentially [Cos, V1] This increase is due to a certain incompleteness of relational algebra with respect to the algebra of polynomials [Cos] Such problems were first noted in [HLY, MSY], as part of the study of nulls in weak universal instances. Data complexity avoids these anomalies, by factoring out the query program representation and maintaining only the combinatorics of the uncertainty in the database. Section 2 contains a detailed definition of the framework. We now ....
Honeyman, P., Ladner, R., Yannakakis, M., "Testing the Universal Instance Assumption ", Information Processing Letters, vol. 10, no. 1, pp. 14--19, 1980.
SIGACT News Complexity Theory Column 14 - Lane Hemaspaandra (Correct)
....of mathematical nastiness. Complexity has been often and brilliantly used within computer science and mathematics in this allegorical way; a computational problem is formulated and proved hard for the sole purpose of pointing out the mathematical difficulties involved in an area or approach (see [HLY80] for an early example from database theory) Complexity as metaphor. Often the implication discussed in the previous paragraph is composed with the metaphors of an application domain or other scientific discipline with sometimes exquisite results. Complexity may mean chaos in the domain of ....
Honeyman, P.; Ladner, R.E.; Yannakakis, M. "Testing the universal instance assumption," Information Processing Letters, 12 Feb. 1980, vol.10, (no.1):14-19.
On Extroverted Complexity Theory - Papadimitriou (Correct)
....of mathematical nastiness. Complexity has been often and brilliantly used within computer science and mathematics in this allegorical way; a computational problem is formulated and proved hard for the sole purpose of pointing out the mathematical difficulties involved in an area or approach (see [6] for an early example from database theory) 1 Computer Science Division, University of California Berkeley; christos cs.berkeley.edu. Adapted from the introduction of [8] 2 Among treatments of complexity theory by scientists outside our field this is one is not the most ignorantly unfair; ....
Honeyman, P.; Ladner, R.E.; Yannakakis, M. "Testing the universal instance assumption," Information Processing Letters, 12 Feb. 1980, vol.10, (no.1):14-19.
NP-completeness: A Retrospective - Papadimitriou (1998) (10 citations) (Correct)
....computer scientists, with the possible exception of researchers in metaphor based algorithmic paradigms such as neural nets, in which algorithmic behavior is thought to be emergent ) then, contrapositively, complexity must be the manifestation of mathematical poverty, lack of structure. See [7] for an early example of such a use of NP completeness in the theory of relational databases. 12. Beyond mathematics, NP completeness (and complexity in general) can also be applied allegorically in other disciplines. It can be used as a metaphor for chaos in dynamical systems, for unbounded ....
P. Honeyman, R. E. Ladner, M. Yannakakis, "Testing the universal instance assumption, " Information Processing Letters, 12, pp. 14--19, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC