1. A method for monitoring and controlling biological substance concentrations in the bloodstream of a patient comprising:
implanting in-vivo a monitoring device comprising a pedestal and a sensor such that the sensor mounted on the pedestal extends into bone marrow for sensing the biological substance concentration;
sensing the concentration of biological substance in the bloodstream with the sensor;
implanting in-vivo a drug delivery device into the bone marrow;
transmitting signals from the sensor to a receiver relating to the biological substance concentration in the bloodstream; and
transmitting signals from the receiver to the drug delivery device such that a dose of a drug is administered to the bone marrow of the patient to control the biological substance concentration in the bloodstream.
2. The method of claim 1 wherein the monitoring device and the drug delivery device are integrated into a single device.
3. The method of claim 1 wherein the monitoring device and the drug delivery device are spaced apart from each other when implanted.
4. The method of claim 1 wherein the monitoring device and the drug delivery device are implanted in the patient’s posterior iliac crest.
5. The method of claim 1 wherein the monitoring device is implanted in the patient’s posterior iliac crest and the drug delivery device is implanted in the contra-lateral posterior iliac crest.
6. The method of claim 1 wherein the signals transmitted from the sensor to the receiver are transmitted over a wireless connection.
7. The method of claim 1 wherein the signals transmitted from the sensor to the receiver are transmitted over a wired connection.
8. The method of claim 1 wherein the signals transmitted from the receiver to the drug delivery device are over a wired connection.
9. The method of claim 1 wherein the signals transmitted from the receiver to the drug delivery device are over a wireless connection.
10. The method of claim 1 wherein the biological substance is cerebrospinal fluid.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of archiving a relational database having tables of rows, comprising:
assigning transaction identifiers to each of the rows in each of the tables such that all rows belonging to the same application transaction share a unique transaction identifier;
determining plural hierarchies, each hierarchy having high level nodes corresponding to the rows in a single table and dependent nodes corresponding to rows in other tables to which the rows in the single table are related in the database;
merging the plural hierarchies to form plural clusters, one cluster for each unique transaction identifier, and each cluster having high level nodes corresponding to the plural hierarchies but only those dependent nodes from the plural hierarchies whose transaction identifiers correspond to that of the cluster; and
storing the plural clusters in one or more files to form an archive.
2. The method of claim 1 wherein:
the steps are performed in a manner such that no row of the database is represented in more than one cluster.
3. The method of claim 1, further comprising:
creating an index to locations of the plural clusters in the archive such that the index is searchable by transaction identifier.
4. The method of claim 1, further comprising:
cutting one of the files forming the archive at a cluster boundary; and
moving one or more clusters in a truncated piece of the one file to another archive.
5. The method of claim 1, further comprising:
retrieving from the archive all information associated with a single application transaction by reading the information from only one cluster in the archive.
6. The method of claim 1, wherein the storing step comprises, for every row to be contained in a given cluster:
storing only one copy of data representing the row’s contents; and
at a position in the given cluster where the row is to appear, storing a pointer or an index suitable for locating the one copy of the data representing the row’s contents.
7. The method of claim 1, wherein:
the storing step is performed such that no single cluster is distributed across more than one file.
8. An archive representing a relational database that has tables of rows, the archive comprising:
at least one tangible computer-readable storage medium having stored thereon at least one file containing at least one cluster, the at least one cluster comprising:
plural top level nodes, each representing a row from a single table, and each associated with its own hierarchy of dependent nodes such that every dependent node in one hierarchy represents a row that is related in the database to a row represented by an ancestor node in the one hierarchy;
wherein each cluster in the archive corresponds to a different application transaction;
wherein, within each cluster, all of the nodes correspond to rows belonging to the same application transaction; and
apparatus configured to locate a cluster of interest on the computer-readable storage medium responsive to an application transaction identifier.
9. The archive of claim 8, wherein:
the clusters in the archive are stored in one or more files such that no single cluster is distributed across more than one file.
10. The archive of claim 8, wherein:
no row of the database is represented in more than one cluster.
11. The archive of claim 8, further comprising:
a second archive; and
apparatus configured to cut the at least one file at a cluster boundary and to move one or more clusters contained in a truncated portion of the file to the second archive.
12. The archive of claim 8, further comprising:
apparatus configured to retrieve, from the cluster of interest and no other cluster, all of the row data associated with a single application transaction.
13. The archive of claim 8, wherein:
for each row contained in the at least one cluster, the cluster comprises only one copy of data representing the row’s contents, and one or more references to the one copy are located in the cluster at positions where the row should appear within a given hierarchy.
14. A system for archiving a relational database having tables of rows, comprising:
transaction identifier assignment logic configured to identify all rows belonging to the same application transaction and to associate those rows with a unique transaction identifier;
hierarchy determination logic configured to determine a set of hierarchies, each hierarchy having high-level nodes and dependent nodes, the high-level nodes corresponding to rows in a single table, and the dependent nodes representing rows that are related in the database to rows represented by ancestor nodes; and
cluster formation logic configured to form a set of clusters, each cluster corresponding to a different transaction identifier;
wherein each cluster comprises high-level nodes, each of the high-level nodes corresponding to one of the hierarchies but including only those dependent nodes from the one hierarchy whose transaction identifiers correspond to that of the cluster.
15. The system of claim 15, wherein:
no row is represented in more than one of the clusters.
16. The system of claim 15:
wherein the clusters are stored on at least one tangible computer-readable storage medium; and
further comprising an index to locations of the clusters on the storage medium, wherein the index is organized by transaction identifier.
17. The system of claim 15, further comprising:
migration logic configured to move at least one cluster of the set from a first to a second file by cutting the first file at a cluster boundary.
18. The system of claim 15, further comprising:
row retrieval logic configured to retrieve all rows associated with an application transaction by reading the rows from a single cluster of the set.
19. The system of claim 15, wherein:
for each row contained in a cluster, only one copy of data representing the row’s contents is stored in the cluster, and references to the one copy are positioned in the cluster where the row should appear.
20. The system of claim 15, wherein:
the clusters in the set are stored in one or more files such that no single cluster is distributed across more than one file.