Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Kapali P. Eswaran"'
Autor:
Kapali P. Eswaran, R. Endre Tarjan
Publikováno v:
SIAM Journal on Computing. 5:653-665
Autor:
Kapali P. Eswaran, Raymond A. Lorie, J. W. Mehl, B. W. Wade, Donald D. Chamberlin, P. P. Griffiths, Phyllis Reisner, Morton M. Astrahan
Publikováno v:
IBM Journal of Research and Development. 20:560-575
SEQUEL 2 is a relational data language that provides a consistent, English keyword-oriented set of facilities for query, data definition, data manipulation, and datac ontrol. SEQUEL 2 may be used either as a stand-alone interface for nonspecialists i
Publikováno v:
IEEE Transactions on Software Engineering. :574-582
This paper considers access control for local area computer communication networks. We propose two distributed access control schemes for a bus network. The schemes are simple and asynchronous, and provide for collision-free communication among ports
Autor:
P. P. Griffiths, V. Watson, M. W. Blasgen, Kapali P. Eswaran, Raymond A. Lorie, Morton M. Astrahan, G. R. Putzolu, J. W. Mehl, W. F. King, Paul McJones, Jim Gray, Irving L. Traiger, B. W. Wade, Donald D. Chamberlin
Publikováno v:
ACM Transactions on Database Systems. 1:97-137
System R is a database management system which provides a high level relational data interface. The systems provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permit
Autor:
Kapali P. Eswaran
Publikováno v:
SIAM Journal on Computing. 4:56-68
Let $Q = \{ q_1 ,q_2 , \cdots ,q_m \} $ be a family of finite, nonempty sets, and $S = \cup_{q_i \in Q} \{ q_i \} $. Suppose there exists a one-to-one function f that maps elements of S into points...
Publikováno v:
Communications of the ACM. 20:874-878
Sequences of character strings with an order relation imposed between sequences are considered. An encoding scheme is described which produces a single, order-preserving string from a sequence of strings. The original sequence can be recovered from t
Publikováno v:
International Journal of Computer & Information Sciences. 7:295-314
By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd-even transposition-sort algorithm to finish in (N + 1)/2 loop times (periods) using (N − 1) comparators. The sorting ca
Publikováno v:
Communications of the ACM. 19:624-633
In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transactio
Publikováno v:
Proceedings of the 1st International Conference on Very Large Data Bases - VLDB '75.
This paper defines an integrity subsystem for an integrated data base management system, and shows how integrity is distinguished from the related areas of security, consistency, and reliability. The integrity subsystem guards the data base against s
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.