Execution of semantic queries using rule expansion

Details Execution of semantic queries using rule expansion Execution of semantic queries using rule expansion

2009-03-31

2011-10-04

Lewis, Cheryl (Department: 2155)

Data processing: database and file management or data structures

Database and file access

Post processing of search results

C707S717000

Reexamination Certificate

active

08032525

ABSTRACT:
A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.

REFERENCES:
patent: 7386541 (2008-06-01), Pal et al.
patent: 2006/0206477 (2006-09-01), Dalvi et al.
patent: 2008/0140387 (2008-06-01), Linker
patent: 2008/0319947 (2008-12-01), Latzina et al.
Georg Gottlob, Nicola Leone and Francesco Scarcello, The Complexity of Acyclic Conjunctive Queries, May 2001, pp. 1-3, Journal of the ACM, vol. 48 Issue 3.
Mathis, et al., “XTCcmp: XQuery Compilation on XTC”, 34th International Conference on Very Large Data Bases, retrieved at <<http://wwwlgis.informatik.uni-kl.de/cms/fileadmin/users/mathis/documents/vldb—demo—08.pdf>>, vol. 1, No. 2, Aug. 24-30, 2008, pp. 1-4.
Kay, Michael, “XSLT and XPath Optimization”, retrieved at <<http://www.saxonica.com/papers/xslt—xpath.pdf>>, 2001, pp. 1-3.
Falconer, et al., “A Declarative Framework for Analysis and Optimization”, in Compiler Construction, Lecture Notes in Computer Science, retrieved at <<http://www.doc.ic.ac.uk/˜phjk/Publications/DeepWeaver-CC07.pdf>>, vol. 4420, date: 2007, pp. 1-15.
Bednarek, David, “Extending Datalog to cover XQuery”, Proceedings of the Conference on Theory and Practice of Information Technologies, retrieved at <<http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-414/paper1.pdf>>, Sep. 2008, pp. 1-6.
Rondogiannis, et al., “The Branching-Time Transformation Technique for Chain Datalog Programs”, Journal of Intelligent Information Systems, retrieved at <<http://cgi.di.uoa.gr/˜prondo/papers/jiis.pdf>>, Jul. 26, 2001, pp. 71-94, Kluwer Academic Publishers, The Netherlands.
Whaley, et al., “Using Datalog with Binary Decision Diagrams for Program Analysis”, In Proceedings of Programming Languages and Systems: Third Asian Symposium, retrieved at <<http://suif.stanford.edu/papers/aplas05.pdf>>, 2005, pp. 1-22.
Bishop, et al., “IRIS—Integrated Rule Inference System”, Proceedings of the Workshop on Advancing Reasoning on the Web: Scalability and Commonsense, retrieved at <<http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-350/paper2.pdf>>, Jun. 2008, pp. 1-15.

Affiliated with

Also associated with

Rating

Execution of semantic queries using rule expansion does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Execution of semantic queries using rule expansion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Execution of semantic queries using rule expansion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4297025