NOSQL
Profit!
&
forFun
TIM ANGLADE PROUDLY PRESENTS PART TWO
OF THE TOTALLY UNKOWN “FUN & PROFITâ€
SERIES. A TALE OF TECH,
INTRIGUE
&Â FORBIDDEN LOVE. A WHIRLWIND OF
ADVENTURERS, PRODUCTION SYSTEMS
&Â TROLLS. A STORY SO BIG, ITS TITLE HAD TO
HAVE ITS OWN INTRODUCTION TEXT. HERE IS…
@TIMANGLADE
Hit me up. I don’t bite… too hard.
AN ANNOUNCEMENT
NØSQL
rope!
Eu
LONDON, APRIL 20TH & 21ST
WORKSHOPS AND TRAINING ON THE 22ND
FOLLOW @NOSQLEU FOR DETAILS
A WARNING
This is Tech for Managers. Don’t Blame Me.
40 YEARS
IN THE DESERT
Information
Retrieval
P. BAXENDALE,
Editor
A Relational Model of Data for
Large Shared Data Banks
E. F. CODD
IBM Research Laboratory, San Jose, California
Future
users
of
large
data
banks
must
be
protected
from
having
to
know
how
the
data
is organized
in the machine
(the
internal
representation).
A
prompting
service
which
supplies
such
information
is not
a satisfactory
solution.
Activities
of
users
at
terminals
and
most
application
programs
should
remain
unaffected
when
the
internal
representation
of data
is changed
and
even
when
some
aspects
of
the
external
representation
are
changed.
Changes
in
data
representation
will
often
be
needed
as a
result
of
changes
in query,
update,
and
report
traffic
and
natural
growth
in
the
types
of
stored
information.
Existing
noninferential,
formatted
data
systems
provide
users
with
tree-structured
files
or
slightly
more
general
network
models
of
the
data.
In Section
1,
inadequacies
of
these
models
are
discussed.
A model
based
on n-ary
relations,
a
normal
form
for
data
base
relations,
and
the
concept
of
a universal
data
sublanguage
are
introduced.
In Section
2, certain
opera-
tions
on
relations
(other
than
logical
inference)
are
discussed
and
applied
to
the
problems
of
redundancy
and
consistency
in the
user’s
model.
KEY WORDS
AND
PHRASES:
data
bank,
data
base,
data structure