ING_DB

WEGA/contrib/ingres/dbs/data/base/ingres/ingres.lit

@@ -0,0 +1,198 @@
+     A N H A N G   -   L i t e r a t u r v e r z ei c h n i s
+     --------------------------------------------------------
+
+
+     *** 1977 ***
+
+     M77/5 : ORANGE MEMO * University of California, Berkeley
+             The Design and Implementation of INGRES
+             Held, Kreps, Stonebraker, Wong
+
+     M77/25 : ORANGE MEMO * University of California, Berkeley
+             A Tutorial on INGRES
+             Epstein
+
+     M77/71 : ORANGE MEMO * University of California, Berkeley
+             Creating and Maintaining a Data Base Using INGRES
+             Epstein
+
+
+     *** 1978 ***
+
+     M78/17 * University of California, Berkeley
+             Query Processing in a Relational Database System
+             Wong, Youssefi
+
+
+     *** 1979 ***
+
+     M79/5 * University of California, Berkeley
+             Data Abstraction, Views and Updates in Rigel
+             Rowe, Shoens
+
+     M79/20 * University of California, Berkeley
+             The Effects of Concurrency Control on DBMS Performance
+             Ries
+
+
+     *** 1980 ***
+
+     M80/9 * University of California, Berkeley
+             Query Processing Techniques for
+             Distributed Relational Database Systems
+             Epstein
+
+
+     *** 1981 ***
+
+     M81/27 * University of California, Berkeley
+             Hypothetical Databases as View
+             Stonebraker
+
+     M81/61 : ORANGE MEMO * University of California, Berkeley
+             INGRES Version 7 Reference Manual
+             Allman, Meyer, Ranstrom, Siegel, Woodfill
+
+     M81/93 * University of California, Berkeley
+             Extending INGRES With a Rules System
+             Johnson, Rosenberg, Stonebraker
+
+     M81/94 * University of California, Berkeley
+             A Sophisticated Relational Browser
+             Kalash, Stonebraker
+
+
+
+
+     *** 1982 ***
+
+     M82/32 : ORANGE MEMO * University of California, Berkeley
+             Document Processing in a Relational Data Base System
+             Guttman, Kalash, Lynn, Stettner, Stonebraker
+
+     M82/37 * University of California, Berkeley
+             Using a Relational DBMS for
+             Computer-Aided Design Data
+             Guttman, Stonebraker
+
+     M82/38 : ORANGE MEMO * University of California, Berkeley
+             A Form Application Development System
+             Rowe, Shoens
+
+     M82/80 : ORANGE MEMO * University of California, Berkeley
+             Database Portals: A New Application Program Interface
+             Rowe, Stonebraker
+
+
+     *** 1983 ***
+
+     M83/2 : ORANGE MEMO * University of California, Berkeley
+             An Implementation of Hypothetical Relations
+             Stonebraker, Woodfill
+
+     M83/3 : ORANGE MEMO * University of California, Berkeley
+             Application of Abstract Data Types and Abstract Indices
+             to CAD Data Bases
+             Guttman, Rubenstein, Stonebraker
+
+     M83/9 * University of California, Berkeley
+             A Physical Design Tool for Relational Databases
+             Youseffi
+
+     M83/55 * University of California, Berkeley
+             Performance Analysis of Distributed Database Systems
+             Andersen, Arnold, Kalash, Ranstrom, Stonebraker, Woodfill
+
+     M83/64 : ORANGE MEMO * University of California, Berkeley
+             R-TREES: A Dynamic Index Structure for Spatial Searching
+             Guttman, Stonebraker
+
+     M83/73 : ORANGE MEMO * University of California, Berkeley
+             QUEL as a Data Type
+             Anderson, Hanson, Rubenstein, Stonebraker
+
+     M83/74 * University of California, Berkeley
+             Virtual Memory Transaction Management
+             Stonebraker
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+     *** 1984 ***
+
+     M84/5 : ORANGE MEMO * University of California, Berkeley
+             Implementation Techniques for
+             Main Memory Database Systems
+             DeWitt, Katz, Olken, Shapiro, Stonebraker, Wood
+
+     M84/58 : ORANGE MEMO * University of California, Berkeley
+             Heuristic Search in Data Base Systems
+             Hanson, Ioannidis, Kung, Sellis, Shapiro, Stonebraker
+
+     M84/87 : ORANGE MEMO * University of California, Berkeley
+             Problems in Supporting Data Base Transactions
+             in an Operating System Transaction Manager
+             Stonebraker
+
+
+     *** 1985 ***
+
+     M85/1 : ORANGE MEMO * University of California, Berkeley
+             Optimization of Extended Database Query Languages
+             Sellis, Shapiro
+
+     M85/6 : ORANGE MEMO * University of California, Berkeley
+             Bounded Recursion in Deductive Data Bases
+             Ioannidis
+
+     M85/46 * University of California, Berkeley
+             Triggers & Inference in Database Systems
+             Stonebraker
+
+     M85/59 : ORANGE MEMO * University of California, Berkeley
+             Extending a Database System with Procedures
+             Anton, Hanson, Stonebraker
+
+     M85/67 : ORANGE MEMO * University of California, Berkeley
+             Inclusion of New Types in Relational Database Systems
+             Stonebraker
+
+     M85/95 : ORANGE MEMO * University of California, Berkeley
+             The Design of POSTGRES
+             Rowe, Stonebraker
+
+
+     *** 1986 ***
+
+     M86/6 * University of California, Berkeley
+             An Analysis of Rule Indexing Implementation
+             in Database Systems
+             Hanson, Sellis, Stonebraker
+
+     M86/19 : ORANGE MEMO * University of California, Berkeley
+             Global Query Optimization
+             Sellis
+
+     M86/40 : ORANGE MEMO * University of California, Berkeley
+             A Shared Object Hierarchy
+             Rowe
+
+     M86/59 : ORANGE MEMO * University of California, Berkeley
+             Object Management in POSTGRES using Procedures
+             Stonebraker
+
+     M86/80 : ORANGE MEMO * University of California, Berkeley
+             The Design of the POSTGRES Rules System
+             Hanson, Hong, Stonebraker

WEGA/contrib/ingres/dbs/data/base/ingres/new.q

@@ -0,0 +1,76 @@
+## char		TITEL[61];
+## int		LINE;
+## char		TYP[61];
+## char		VERLAG[61];
+## char		ORT[61];
+## char		JAHR[61];
+## char		AU[61];
+## int		ID;
+
+main()
+{
+##	ing_db ingres
+##	range of r is relation
+##	retrieve (ID = r.reltups) where r.relid = "doc"
+##	{
+		printf("ENTER INGRES DOCUMENT\n\n");
+##	}
+	ID++;
+	while (enter("\nJAHR", JAHR))
+	{
+		LINE = 0;
+		*TYP = 0;
+		*VERLAG = 0;
+		*ORT = 0;
+		*AU = 0;
+		if (enter("TYP", TYP) == 0)
+			continue;
+		if (enter("VERLAG", VERLAG) == 0)
+			continue;
+		if (enter("ORT", ORT) == 0)
+			continue;
+		while (enter("TITEL", TITEL))
+		{
+##			append doc
+##			(
+##				line = LINE,
+##				titel = TITEL,
+##				typ = TYP,
+##				verlag = VERLAG,
+##				ort = ORT,
+##				jahr = JAHR,
+##				id = ID
+##			)
+			LINE++;
+		}
+		while (enter("AUTOR", AU))
+		{
+##			append au
+##			(
+##				au = AU,
+##				id = ID
+##			)
+		}
+		ID++;
+	}
+}
+
+
+enter(msg, buf)
+register char	*msg;
+register char	*buf;
+{
+	register char	*p;
+	register int	c;
+
+	printf("%s: ", msg);
+	p = buf;
+	while ((c = getchar()) >= 0)
+	{
+		if (c == '\n')
+			break;
+		*p++ = c;
+	}
+	*p = 0;
+	return (p - buf);
+}

WEGA/contrib/ingres/dbs/data/base/ingres/print.q

@@ -0,0 +1,93 @@
+# include	<stdio.h>
+
+## char		TITEL[61];
+## int		LINE;
+## char		TYP[61];
+## char		AU[61];
+## long		ID;
+## long		NID;
+
+main()
+{
+	register char	*p;
+	register int	cnt;
+
+##	ing_db ingres
+##	range of d is doc
+##	range of a is au
+
+	ID = -1;
+	for ( ; ; )
+	{
+		cnt = 0;
+##		retrieve
+##		(
+##			NID   = d.id,
+##			LINE  = d.line,
+##			TITEL = d.titel,
+##			TYP   = d.typ
+##		)
+##		where d.id > ID
+##		{
+			if (cnt++ != LINE)
+				break;
+
+			ID = NID;
+			format(TITEL, 59);
+			if (LINE == 0)
+			{
+				format(TYP, 59);
+				printf("%s * University of California, Berkeley\n", TYP);
+			}
+			printf("\t%s\n", TITEL);
+##		}
+
+		if (cnt == 0)
+			break;
+
+		cnt = 0;
+##		retrieve (AU = a.au) where a.id = ID
+##		{
+			if (cnt++ == 0)
+				putchar('\t');
+			else
+				printf(", ");
+			format(AU, 49);
+			printf("%s", AU);
+##		}
+		printf("\n\n");
+	}
+}
+
+
+enter(msg, buf)
+register char	*msg;
+register char	*buf;
+{
+	register char	*p;
+	register int	c;
+
+	fprintf(stderr, "%s:\t", msg);
+	p = buf;
+	while ((c = getchar()) >= 0)
+	{
+		if (c == '\n')
+			break;
+		*p++ = c;
+	}
+	*p = 0;
+	return (p - buf);
+}
+
+
+format(msg, len)
+register char	*msg;
+register int	len;
+{
+	register char	*p;
+
+	p = &msg[len];
+	while (*p == ' ')
+		--p;
+	p[1] = 0;
+}