Dynamically generated schema representing multiple...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10967435

ABSTRACT:
Systems and methods for dynamically generating a schema representing multiple hierarchies of inter-object relationships are described. In one aspect, a polyarchical query language data structure includes first, second, and third data fields. The first data field is used to specify a particular schema for presenting or managing a plurality of objects in a data polyarchy based on values of attributes in the objects. The second data field is to indicate an attribute of interest. The third data field indicates how one or more objects that include the attribute of interest are to be presented or managed with respect to one or more participating dimensions of inter-object relationships based on the schema.

REFERENCES:
patent: 5313633 (1994-05-01), Tomita et al.
patent: 5665018 (1997-09-01), Miyata
patent: 5802511 (1998-09-01), Kouchi et al.
patent: 5812134 (1998-09-01), Pooser et al.
patent: 5859978 (1999-01-01), Sonderegger et al.
patent: 5875446 (1999-02-01), Brown et al.
patent: 5930369 (1999-07-01), Cox et al.
patent: 5970496 (1999-10-01), Katzenberger
patent: 5999911 (1999-12-01), Berg et al.
patent: 6064764 (2000-05-01), Bhaskaran et al.
patent: 6219053 (2001-04-01), Tachibana et al.
patent: 6223145 (2001-04-01), Hearst
patent: 6243480 (2001-06-01), Zhao et al.
patent: 6285366 (2001-09-01), Ng et al.
patent: 6289382 (2001-09-01), Bowman-Amuah
patent: 6317749 (2001-11-01), Ghatate
patent: 6345100 (2002-02-01), Levine
patent: 6345104 (2002-02-01), Rhoads
patent: 6434564 (2002-08-01), Ebert
patent: 6442557 (2002-08-01), Buteau et al.
patent: 6463420 (2002-10-01), Guidice et al.
patent: 6489970 (2002-12-01), Pazel
patent: 6556984 (2003-04-01), Zien
patent: 6564263 (2003-05-01), Bergman et al.
patent: 6636250 (2003-10-01), Gasser
patent: 6643652 (2003-11-01), Helgeson et al.
patent: 6708161 (2004-03-01), Tenorio et al.
patent: 6754666 (2004-06-01), Brookler et al.
patent: 6785667 (2004-08-01), Orbanes et al.
patent: 6807634 (2004-10-01), Braudaway et al.
patent: 6901515 (2005-05-01), Muratani
patent: 6938046 (2005-08-01), Cooke et al.
patent: 2001/0047385 (2001-11-01), Tuatini
patent: 2002/0009208 (2002-01-01), Alattar et al.
patent: 2002/0169744 (2002-11-01), Cooke et al
patent: 2002/0191809 (2002-12-01), Darko et al.
patent: 2004/0002982 (2004-01-01), Ersek et al.
patent: 2004/0143742 (2004-07-01), Muratani
patent: 0951183 (1999-10-01), None
patent: WO97/34391 (1997-09-01), None
“Information Technology—Open Systems Interconnection—The Directory: The Models” Recommendation X.501 ISO/IEC 9594-2 Feb. 14, 1993 164 pages.
Biron et al.; (www.w3.org) discloses a “XML Schema Part 2: Datatypes” W3C Recommendations May 2, 2001 pp. 1-21.
Chita Christian; “Hierarchy Visualization” Publication retrieved from the internet in May 2004 http://www.cs.ubc.ca/tmm/courses/cpsc533c-04-spr/slides/0331.cchita2.6up.pdf.
M Wahl et al; “Lightweight Directory Access Protocol (v3): UTF-8 String Representation of Distinguished Names” The Internet Society 10 pages.
M Wahl et al.; “Lightweight Directory Access Protocol (v3)” Internet Society Dec. 1997 50 pages.
M. Wahl et al; “Lightweight Directory Access Protocol (v3): Attribute Syntax Definitions” The Internet Society Dec. 1997 32 pages.
M. Wahl; “A Summary of the X.500(96) User Schema for use with LDAPv3” The Internet Society Dec. 1997 20 pages.
Melbourne; “The Directory—Overview of Concepts Models and Services” 1988 47 pages.
T Howes; “The String Representation of LDAP Search Filters” The Internet Society 8 pages.
T. Howes et al.; “The LDAP URL Format” The Internet Society Dec. 1997 8 pages.
Yamamoto, et al., “A Method of Image Watermarking which can Detect All Illegal Users in Collusion”, retrieved on 1998 Symposium on Cryptography and Information Security, Hammanako, Japan, Jan. 28-31, 1998, English Language Translation, p. 08.
Baeza-Yates et al., “New Approaches to Information Management: Attribute-Centric Data Systems”, String Processing and Information Retrieval, 2000. Spire 2000. Proceedings. Seventh International Symposium on Sep. 27-29, 2000. Piscataway, NJ, USA, IEEE, Sep. 27, 2000, pp. 17-27.
Furnas et al, “Multitrees: Enriching and Reusing Hierarchical Structure”, 1994. Hum Factors Comput Syst; Conference Proceedings on Human Factors in Computing Systems; Celebrating Independence 1994. Published by ACM. New York, USA, pp. 330-336.
“Collusion-secure fingerprinting for digital data” Information Theory IEEE Transactionon vol. 44 Issue 5 Sep. 1998 pp. 1897-1905.
“Secure spread spectrum watermarking for multimedia” Image Processing IEEE Transactions on vol. 6 Issue 12 Dec. 1997 pp. 1673-1687.
“Digital watermarking of Images and video using direct sequence spread spectrum techniques” Electrical and Computer Engineering 1999 IEEE Canadian Conference on vol. 1 1999 pp. 116-121.
“Fast public-key watermarking of compressed video”Proceedings International Conference on Image Processing 26-29 Ocv. 1997 pp. 528-531 vol. 1.
“Optimum watermark detection and embedding in digital images” Multimedia Signal Processing 1998 IEEE Second Workshop on 1998 pp. 285-290.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamically generated schema representing multiple... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically generated schema representing multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically generated schema representing multiple... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3720610

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.