Complexity metrics for data schemas

Details Complexity metrics for data schemas Complexity metrics for data schemas

2006-03-16

2010-12-28

Dam, Tuan Q (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Testing or debugging

C717S124000, C717S141000, C714S047300, C707S793000, C707S634000, C707S637000

Reexamination Certificate

active

07861229

ABSTRACT:
A schema code complexity analysis architecture that computes complexity data for output to a code designer. The complexity data can be in the form of a number and/or complexity level. A schema component is provided for processing schema code, and a metrics component, for outputting a complexity value based on complexity of the schema code. In one implementation, the schema code is based on an XML schema, and the metrics component employs a newly-defined variation of a McCabe cyclomatic complexity metric to determine the complexity value. The decisions employed for computing schema complexity can include choices, occurrence constraints, element references to substitution groups, type references to types that are extended or restricted, a multiplicity of root element declarations, and nillable elements.

REFERENCES:
patent: 6044152 (2000-03-01), Mendolia
patent: 6104916 (2000-08-01), Steinhoff et al.
patent: 6128773 (2000-10-01), Snider
patent: 6230269 (2001-05-01), Spies et al.
patent: 6651244 (2003-11-01), Smith et al.
patent: 6662300 (2003-12-01), Peters
patent: 6754507 (2004-06-01), Takagi
patent: 6845380 (2005-01-01), Su et al.
patent: 6848078 (2005-01-01), Birsan et al.
patent: 6912538 (2005-06-01), Stapel et al.
patent: 6925313 (2005-08-01), Kweon et al.
patent: 7152244 (2006-12-01), Toomey
patent: 2002/0087571 (2002-07-01), Stapel et al.
patent: 2003/0023876 (2003-01-01), Bardsley et al.
patent: 2003/0025668 (2003-02-01), Lin
patent: 2003/0163737 (2003-08-01), Roskind
patent: 2003/0199289 (2003-10-01), Kao et al.
patent: 2003/0204481 (2003-10-01), Lau
patent: 2004/0044678 (2004-03-01), Kalia et al.
patent: 2004/0060007 (2004-03-01), Gottlob et al.
patent: 2004/0128296 (2004-07-01), Krishnamurthy et al.
patent: 2004/0143581 (2004-07-01), Bohannon et al.
patent: 2004/0158714 (2004-08-01), Peyravian
patent: 2004/0261018 (2004-12-01), Dunne et al.
patent: 2005/0022020 (2005-01-01), Fremberg
patent: 2005/0041009 (2005-02-01), Kuroda
patent: 2005/0049017 (2005-03-01), Yoda
patent: 2005/0068913 (2005-03-01), Tan et al.
patent: 2005/0087769 (2005-04-01), Yamazaki et al.
patent: 2005/0108567 (2005-05-01), D'Souza et al.
patent: 2005/0127820 (2005-06-01), Yamazaki et al.
patent: 2005/0177578 (2005-08-01), Chen
patent: 2005/0179850 (2005-08-01), Du
patent: 2005/0182778 (2005-08-01), Heuer et al.
patent: 2005/0192990 (2005-09-01), Kharitidi et al.
patent: 2005/0229097 (2005-10-01), Lander
patent: 2005/0235358 (2005-10-01), Keohane et al.
patent: 2006/0055608 (2006-03-01), Minemura
patent: 2006/0200856 (2006-09-01), Salowey et al.
patent: 2006/0216469 (2006-09-01), Hashizume
patent: 2006/0232495 (2006-10-01), Chang et al.
patent: 2006/0250312 (2006-11-01), Kobayashi
patent: 2007/0005984 (2007-01-01), Florencio et al.
patent: 2007/0006305 (2007-01-01), Florencio et al.
patent: 2007/0199054 (2007-08-01), Florencio et al.
patent: 2007/0255751 (2007-11-01), Bansal et al.
patent: 2008/0015002 (2008-01-01), Crisp
patent: 14-073553 (2002-03-01), None
Title: Determining the complexity of XML documents Author: Qureshi, Mustafa, and Samadzadeh M.H. Conference Title: ITCC 2005—International Conference on Information Technology:Coding and Computing. Conference Location : Las Vegas NV, USA.
Title: A DTD Complexity Metrics. Author: McFadyen Ron, and Chen Yangjun. Confernce Title: 21st IASTED International Multi-Confernce on Applied Informatics. Conference Location: Innsbruck, Austria.
Adida, B. et al., “Fighting Phishing Attacks: A Lightweight Trust Architecture for Detecting Spoofed Emails,” in Proceedings of DIMACS Workshop on Theft in E-Commerce: Content, Identity, and Service, Piscataway, New Jersey, Apr. 2005, 16 pages.
Adida, B. et al., “Separable Identity-based Ring Signatures: Theoretical Foundations for Fighting Phishing Attacks,” in Proceedings of DIMACS Workshop on Theft in E-Commerce: Content, Identity, and Service, Piscataway, New Jersey, Feb. 28, 2005, 18 pages.
Anti-Phishing Working Group, at http://www.antiphishing.org, last accessed Feb. 28, 2006.
Bloom Filter http://www.nist.gov/dads/HTML/bloomFilter.html, last viewed, Mar. 14, 2006, 1 page.
Boneh, et al., “Defending Against Online Identity Theft and Phishing,” presentation given at Proceedings: United States—Japan Critical Information Infrastructure Protection Workshop, Sep. 2004, available at: http://www2.gwu.edu/˜usjpciip/BonehD.pdf.
Boneh, et al., “Web Password Hashing,” 3 pages, last accessed Jun. 28, 2005, available at: http://crypto.stanford.edu/PwdHash/.
Chou, N. et al., “Client-Side Defense Against Web-Based Identity Theft,” in Proceedings of 11th Annual Network and Distributed System Security Symposium (NDSS '04), San Diego, Feb. 2004, 16 pages.
Delany, M., “Domain-Based Email Authentication Using Public-Keys Advertised in the DNS (DomainKeys),” Internet Draft available at: http://www.ietf.org/internet-drafts/draft-delany-domainkeys-base-03.txt, Sep. 29, 2005, last checked Feb. 24, 2006, 40 pages.
Earthlink Toolbar Featuring ScamBlocker for Windows Users http://www/earthlink.net/software/free/toolbar/, last accessed Mar. 14, 2006, 2 pages.
Florencio, D. and Herley, C., “Stopping a Phishing Attack, Even When the Victims Ignore Warnings,” Microsoft Research Technical Report, Oct. 2005. Available at: http://research.microsoft.com/research/pubs/view.aspx?type=Publication&id=1489, last accessed Feb. 24, 2006.
Gabber, E. et al., “How to Make Personalized Web Browsing Simple, Secure, and Anonymous,” Financial Cryptography, 1997, pp. 17-32.
Halderman, J.A. et al., “A Convenient Method for Securely Managing Passwords,” in Proceedings of the 14th International World Wide Web Conference (WWW 2005), Chiba, Japan, May 10-14, 2005, 9 pages.
http://www.passport.com, links directly to: https://accountservices.passport.net/ppnetworkhome.srf?vv=330&lc=1033, last accessed Feb. 28, 2006.
http://www.spoofstick.com, last accessed Feb. 28, 2006.
International Search Report dated Oct. 24, 2007 for PCT Application Serial No. PCT/US2007/004044, 3 Pages.
Jakobsson, M. and Young, A., “Distributed Phishing Attacks,” in Proceedings of DIMACS Workshop on Theft in E-Commerce: Content, Identity, and Service, Piscataway, New Jersey, Apr. 2005, 10 pages.
Kelsey, J. et al., “Secure Applications of Low-Entropy Keys,” Lecture Notes in Computer Science, 1997, vol. 1396, pp. 121-134.
Netcraft, “Netcraft Toolbar Help Pages FAQ,” 2004, available at: http://toolbar.netcraft.com/help/faq/index.html.
Oechslin, P., “Making a Faster Cryptanalytical Time-Memory Trade-Off,” in Proceedings of Advances in Cryptology—CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, Aug. 17-21, 2003, 15 pages.
Ross, B. et al., “A Browser Plug-In Solution to the Unique Password Problem,” in Proceedings of the 14th USENIX Security Symposium, Technical Report Stanford-SecLab-TR-2005-1, 2005, 15 pages.
Ross, et al. “Stronger Password Authentication Using Browser Extensions” (2005) Proceedings of the 14th Usenix Security Symposium 15 pages.
Sahami, M. et al., “A Bayesian Approach to Filtering Junk Email,” in AAAI '98 Workshop on Learning for Text Categorization, Jul. 1998, 8 pages.
Luc Segoufin, Typing and Querying XML Documents: Some Complexity Bounds http://delivery.acm.org/10.1145/780000/773170/p167-segoufin.pdf?key1=773170&key2=7019847311&coll=GUIDE&dl=GUIDE&CFID=65860176&CFTOKEN=65663645.
Mustafa H. Qureshi, et al., Determining the Complexity of XML Documents http://doi.ieeecomputersociety.org/10.1109/ITCC.2005.126.
Thomas J. McCabe, A complexity measure http://portal.acm.org/citation.cfm?id=807712&coll=GUIDE&dl=GUIDe&CFID=62736624&CFTOKEN=661444&ret=1#Fulltext.
James F. Power, et al., A metrics suite for grammar-based software, Journal of Software Maintenance and Evolution: Research and Practice, 2004 http://www.cs.nuim.ie/˜jpower/Resear

Affiliated with

Also associated with

Rating

Complexity metrics for data schemas does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Complexity metrics for data schemas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity metrics for data schemas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4206854