Data structure mapping and packaging

Details Data structure mapping and packaging Data structure mapping and packaging

2002-12-02

2009-12-01

Stevens, Robert (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C709S236000

Reexamination Certificate

active

07627585

ABSTRACT:
A computer program product includes instructions operable to cause a data processing apparatus to receive a packed data structure, receive a linked data assemblage, identify a discrepancy between the packed data structure and the linked data assemblage, and update one of the packed data structure and the linked data assemblage to remove the discrepancy. In the packed data structure, a description of a relationship to a second element is included with a description of a first element. In the linked data assemblage, a description of the relationship between the first element and the second element is separate from the description of the first element and a description of the second element. The computer program product can be tangibly stored on a computer-readable medium.

REFERENCES:
patent: 4459658 (1984-07-01), Gabbe et al.
patent: 4768149 (1988-08-01), Konopik et al.
patent: 4803651 (1989-02-01), Galkowski
patent: 5129083 (1992-07-01), Cutler et al.
patent: 5247658 (1993-09-01), Barrett et al.
patent: 5263160 (1993-11-01), Porter et al.
patent: 5359724 (1994-10-01), Earle
patent: 5440744 (1995-08-01), Jacobson et al.
patent: 5467472 (1995-11-01), Williams et al.
patent: 5630125 (1997-05-01), Zellweger
patent: 5652882 (1997-07-01), Doktor
patent: 5675784 (1997-10-01), Maxwell et al.
patent: 5680616 (1997-10-01), Williams et al.
patent: 5689702 (1997-11-01), Bulusu
patent: 5740425 (1998-04-01), Povilus
patent: 5758353 (1998-05-01), Marquis
patent: 5778223 (1998-07-01), Velissaropoulos et al.
patent: 5845276 (1998-12-01), Emerson et al.
patent: 5872769 (1999-02-01), Caldara et al.
patent: 5881380 (1999-03-01), Mochizuki et al.
patent: 5884314 (1999-03-01), Bulusu
patent: 5970494 (1999-10-01), Velissaropoulos et al.
patent: 6131098 (2000-10-01), Zellweger
patent: 6138123 (2000-10-01), Rathbun
patent: 6170742 (2001-01-01), Yacoob
patent: 6223342 (2001-04-01), George
patent: 6233540 (2001-05-01), Schaumont et al.
patent: 6321983 (2001-11-01), Katayanagi et al.
patent: 6323867 (2001-11-01), Nookala et al.
patent: 6388586 (2002-05-01), Fischer et al.
patent: 6417760 (2002-07-01), Mabuchi et al.
patent: 6427147 (2002-07-01), Marquis
patent: 6470490 (2002-10-01), Hansen
patent: 6480868 (2002-11-01), Abdallah et al.
patent: 6502115 (2002-12-01), Abdallah et al.
patent: 6557752 (2003-05-01), Yacoob
patent: 6646576 (2003-11-01), Delvaux et al.
patent: 6819986 (2004-11-01), Hong et al.
patent: 6848029 (2005-01-01), Coldewey
patent: 6865614 (2005-03-01), Fischer et al.
patent: 7055146 (2006-05-01), Durr et al.
patent: 7124302 (2006-10-01), Ginter et al.
patent: 2001/0042240 (2001-11-01), Ng et al.
patent: 2002/0188436 (2002-12-01), Schmidt et al.
patent: 2003/0014550 (2003-01-01), Fischer et al.
patent: 2003/0187856 (2003-10-01), Luk et al.
patent: 2004/0133747 (2004-07-01), Coldewey
Parent, Christine, et al., “Spatio-Temporal Conceptual Models: Data Structures + Space + Time”, ACM GIS '99, Kansas City, MO, Nov. 1999, pp. 26-33.
Housel, Barron C., et al., “A High-Level Data Manipulation Language for Hierarchical Data Structures”, Proceedings of the 1976 ACM Conference on Data: Abstraction, Definition and Structure, Salt Lake City, UT, Mar. 1976, pp. 155-169.
Florescu, Daniela, et al., “Database Techniques for the World-Wide Web: A Survey”, SIGMOD Record, vol. 27, No. 3, Sep. 1998, pp. 59-74.
Batory, Don, et al., “Scalable Software Libraries”, SIGSOFT '93, © 1993, pp. 191-199.
Sirkin, Marty, et al., “Software Components in a Data Structure Precompiler”, Proc. of the 15th International Conf. on Software Engineering, Baltimore, MD, © 1993, pp. 437-446.
Zhang, Youtao, et al., “Data Compression Transformations for Dynamically Allocated Data Structures”, CC 2002, LNCS 2304, Grenoble, France, Apr. 8-12, 2002, pp. 14-28.
Driscoll, James R., et al., “Making Data Structures Persistent”, Proc. of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, © 1986, pp. 109-121.
Kernighan, Brian W., et al., The C Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, © 1978, pp. 128-141.
Ferragina, Paolo, et al., “The String B-Tree: A New Data Structure for String Search in External Memory and Its Applications”, Journal of the ACM, vol. 46, No. 2, Mar. 1999, pp. 236-280.
Nazareth, J. L., “Implementation Aids for Optimization Algorithms that Solve Sequences of Linear Programs”, ACM Transactions on Mathematical Software, vol. 12, No. 4, Dec. 1986, pp. 307-323.
Moen, Sven, “Drawing Dynamic Trees”, IEEE Software, vol. 7, Issue 4, Jul. 1990, pp. 21-28.
Tsakalidis, Athanasios K., “Maintaining Order in a Generalized Linked List”, Acta Informatica, Springer, Berlin, Germany, vol. 21, No. 1, May 1984, pp. 101-112.
Hendren, Laurie J., et al., “Abstractions for Recursive Pointer Data Structures: Improving the Analysis and Transformation of Imperative Programs”, ACM SIGPLAN Notices, vol. 27, Issue 7, Jul. 1992, pp. 249-260.
Darragh, John J., et al., “Bonsai: A Compact Representation of Trees”, Software—Practice and Experience, vol. 23, No. 3, Mar. 1993, pp. 277-291.
Oberman, Stuart, et al., “AMD 3DNOW! Technology: Architecture and Implementations”, IEEE Micro, Mar./Apr. 1999, pp. 37-48.
Agarwal, S., et al., “Architecting Object Applications For High Performance With Relational Databases,” Aug. 10, 1995, retrieved from the Internet on Dec. 7, 2004, at http://www-db.stanford.edu/pub/keller/1995/high-perf.pdf; 8 pgs., XP002295495.
Blaha, M.R., et al., “Relational Database Design Using an Object-Oriented Methodology,”Communications of the Association for Computing Machinery, New York, US, v. 31, n. 4, Apr. 1, 1988, pp. 414-427, XP000005754.
Carey, Michael, et al., “O-O, What Have They Done to DB2?”Proceedings of the 25thVLDB Conference, 1999, retrieved from the Internet on Nov. 5, 2004, at http://www.vldb.org/conf/1999/P51.pdf, pp. 542-553, XP002304516.
“Mapping to Relational Databases,”eaa.book, retrieved from the Internet on Nov. 6, 2004, at http://www.aw-bc.com/samplechapter/0321127420.pdf, pp. 33-53, XP002304515.
Meng, Weiyi, et al., “Transformation of Relational Schemas to Object-Oriented Schemas,” Aug. 9, 1995,Proceedings of the 19th International Computer Software and Applications Conference(COMPSAC'95), Dallas, Texas, pp. 356-361, XP010192752.
Noser, Hansrudi, et al., “Dynamic 3D Visualization of Database-Defined Tree Structures on the WWW by Using Rewriting Systems,”Proceedings of the International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems, Jun. 8, 2000, retrieved from the Internet on Dec. 7, 2004, at http://www.ifi.unizh.ch/˜noser/BIBLIO/wecwis01.pdf, pp. 247-254, XP002262516.
School of Computer Science & Information Systems, “Access Databases—Introduction,”Introduction to Computing, Oct. 1, 2002, retrieved from the Internet on Dec. 7, 2004, at http://www.dcs.bbk.ac.uk/˜galitsky/ITC/access1.pdf, pp. 1-4, XP002304473.

Affiliated with

Also associated with

Rating

Data structure mapping and packaging does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data structure mapping and packaging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data structure mapping and packaging will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4125263