Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin

First Page		Document Content
Date: 2009-10-31 07:01:31 Data management Computing Information science Query optimization SQL Directed acyclic graph Bin Theoretical computer science Database theory Search algorithms Lowest common ancestor Conjunctive query		Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin Add to Reading List Source URL: www.cs.tau.ac.il Download Document from Source Website File Size: 287,01 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document