Difference between revisions of "Reading List"

From VistrailsWiki
Jump to navigation Jump to search
(Created page with '== Provenance: Overview == * [http://www.cs.utah.edu/~juliana/pub/freire-tutorial-sigmod2008.pdf Provenance and Scientific Workflows: Challenges and Opportunities] Susan Davids…')
 
Line 13: Line 13:
== Provenance in Databases  ==
== Provenance in Databases  ==


Would like to present: Avishek (10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique:  
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.soe.ucsc.edu/~wctan/papers/2007/pdb-ieee.pdf Provenance in Databases: Past, Current, and Future] W. Tan. IEEE Data Engineering Bulletin. (short overview)  
* [http://www.soe.ucsc.edu/~wctan/papers/2007/pdb-ieee.pdf Provenance in Databases: Past, Current, and Future] W. Tan. IEEE Data Engineering Bulletin. (short overview)  
Line 29: Line 29:
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Mark Valentine (5), David Koop (5)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>




Line 44: Line 44:
== Provenance/Workflow/Graph Indexing ==
== Provenance/Workflow/Graph Indexing ==


Would like to present:  Mark Valentine (10), David Koop (10)
Would like to present:  <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique:  Avishek Saha (10)
Would like to critique:  <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.cs.nyu.edu/shasha/papers/graphgrep/pods2002.pdf Algorithmics and Applications of Tree and Graph Searching] D. Shasha, J. T. L. Wang, and R. Giugno.  PODS 2002.
* [http://www.cs.nyu.edu/shasha/papers/graphgrep/pods2002.pdf Algorithmics and Applications of Tree and Graph Searching] D. Shasha, J. T. L. Wang, and R. Giugno.  PODS 2002.
Line 55: Line 55:




Some more papers:
Additional papers:


* [http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/34/20643/00954600.pdf?arnumber=954600 Efficient Matching and Indexing of Graph Models in Content-Based Retrieval] by Stefano Berretti , Alberto Del Bimbo , Enrico Vicario, IEEE TPAMI 2001   
* [http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/34/20643/00954600.pdf?arnumber=954600 Efficient Matching and Indexing of Graph Models in Content-Based Retrieval] by Stefano Berretti , Alberto Del Bimbo , Enrico Vicario, IEEE TPAMI 2001   
Line 82: Line 82:
== Provenance Mining  ==
== Provenance Mining  ==


Would like to present: Parasaran Raman (10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Zhan Wang (10)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.cs.utah.edu/~juliana/pub/tvcg-recommendation2008.pdf VisComplete: Automating Suggestions for Visualization Pipelines.] David Koop, Carlos E. Scheidegger, Steven P. Callahan, Huy T. Vo, Juliana Freire and Claudio T. Silva. In IEEE Transactions on Visualization and Computer Graphics, 14(6), pp. 1691-1698, 2008.  
* [http://www.cs.utah.edu/~juliana/pub/tvcg-recommendation2008.pdf VisComplete: Automating Suggestions for Visualization Pipelines.] David Koop, Carlos E. Scheidegger, Steven P. Callahan, Huy T. Vo, Juliana Freire and Claudio T. Silva. In IEEE Transactions on Visualization and Computer Graphics, 14(6), pp. 1691-1698, 2008.  
Line 96: Line 96:
== Provenance Applications: Publications ==
== Provenance Applications: Publications ==


Would like to present: Mark Valentine (5), Pravin(5)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Zhan Wang (10)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4720217&isnumber=4720211 Reproducible Research] Fomel, Sergey; Claerbout, Jon F. CiSE Volume: 11 Issue: 1 Date: Jan.-Feb. 2009 Page(s): 5-7 Digital Object Identifier 10.1109/MCSE.2009.14  
* [http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4720217&isnumber=4720211 Reproducible Research] Fomel, Sergey; Claerbout, Jon F. CiSE Volume: 11 Issue: 1 Date: Jan.-Feb. 2009 Page(s): 5-7 Digital Object Identifier 10.1109/MCSE.2009.14  
Line 108: Line 108:
== Provenance: Security and Privacy ==
== Provenance: Security and Privacy ==


Would like to present: Parasaran Raman (10), Zhan Wang(5), Komal (10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Mark Valentine (10), David Koop (5)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.cs.utah.edu/~juliana/rtdb2008/References/braun-hotsec2008.pdf Securing provenance.]  Braun, A. Shinnar, and M. Seltzer.  In HotSec’08, 2008.  
* [http://www.cs.utah.edu/~juliana/rtdb2008/References/braun-hotsec2008.pdf Securing provenance.]  Braun, A. Shinnar, and M. Seltzer.  In HotSec’08, 2008.  
Line 129: Line 129:
== Storing Scientific Data ==
== Storing Scientific Data ==


Would like to present: Parasaran Raman (5), Zhan Wang (10), Komal (10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Parasaran Raman (10)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.cs.utah.edu/~juliana/rtdb2008/References/sears-cidr2007 To BLOB or Not To BLOB: Large Object Storage in a Database or a Filesystem?] Russell Sears; Catharine Van Ingen; Jim Gray. CIDR 2007
* [http://www.cs.utah.edu/~juliana/rtdb2008/References/sears-cidr2007 To BLOB or Not To BLOB: Large Object Storage in a Database or a Filesystem?] Russell Sears; Catharine Van Ingen; Jim Gray. CIDR 2007
Line 141: Line 141:
== Web schema matching and schema integration ==
== Web schema matching and schema integration ==


Would like to present: Thanh Nguyen (10), Avishek Saha (10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Parasaran Raman (10) , Huong Nguyen (10), Avishek Saha (5)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Thanh:
Thanh:
Line 192: Line 192:
=== Relational data on the Web ===
=== Relational data on the Web ===


Would like to present: Huong Nguyen (10), Avishek Saha (10), Pravin(10) , Komal(10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Parasaran Raman (5) , Thanh Nguyen (10), Ramesh(5), Zhan Wang (10)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Pravin
Pravin
Line 218: Line 218:


=== Data integration on the fly (or almost...) ===
=== Data integration on the fly (or almost...) ===
Would like to present: Zhan Wang (5)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique:  Mark Valentine (10), Avishek Saha (10), Ramesh(10)
Would like to critique:  <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Zhan:
Zhan:
Line 227: Line 227:
* [http://www.cs.utah.edu/~juliana/rtdb2008/References/dong-sigmod2007 Indexing dataspaces.] Xin Dong and Alon Halevy. SIGMOD 2007.
* [http://www.cs.utah.edu/~juliana/rtdb2008/References/dong-sigmod2007 Indexing dataspaces.] Xin Dong and Alon Halevy. SIGMOD 2007.


Some more papers:
Additional papers:


* [http://www.cs.utah.edu/~juliana/rtdb2008/References/jeffery-sigmod2008.pdf Pay-as-you-go user feedback for dataspace systems.] Shawn R. Jeffery, Michael J. Franklin, Alon Y. Halevy. SIGMOD Conference 2008: 847-860
* [http://www.cs.utah.edu/~juliana/rtdb2008/References/jeffery-sigmod2008.pdf Pay-as-you-go user feedback for dataspace systems.] Shawn R. Jeffery, Michael J. Franklin, Alon Y. Halevy. SIGMOD Conference 2008: 847-860
Line 272: Line 272:


== The Deep Web ==
== The Deep Web ==
Would like to present: Huong Nguyen (10), Pravin(10), Ramesh(10), Zhan Wang (10), Komal(10)
Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Would like to critique: Thanh Nguyen (10), Avishek Saha (10), Ramesh(10), Komal(10)
Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


* [http://www.cs.cornell.edu/~lucja/Publications/I03.pdf Google's Deep Web crawl.]  Jayant Madhavan, David Ko, Lucja Kot, Vignesh Ganapathy, Alex Rasmussen, Alon Y. Halevy. PVLDB 1(2): 1241-1252 (2008) (*Ramesh will present this)
* [http://www.cs.cornell.edu/~lucja/Publications/I03.pdf Google's Deep Web crawl.]  Jayant Madhavan, David Ko, Lucja Kot, Vignesh Ganapathy, Alex Rasmussen, Alon Y. Halevy. PVLDB 1(2): 1241-1252 (2008) (*Ramesh will present this)

Revision as of 13:21, 24 January 2012

Provenance: Overview

Provenance in Databases

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

  • Curated Databases W. Tan, P. Buneman, J. Cheney, S. Vansumerren. ACM Symposium on Principles of Database Systems (PODS), 2008.

Provenance Management: Storage, Indexing and Querying

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


  • Querying and Creating Visualizations by Analogy. Carlos E. Scheidegger, Huy T. Vo, David Koop, Juliana Freire and Claudio T. Silva. IEEE Transactions on Visualization and Computer Graphics, 13(6), pp. 1560-1567, 2007. Best paper in IEEE Visualization 2007.

Provenance/Workflow/Graph Indexing

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Additional papers:


Presentation:

Video lecture:

Provenance Mining

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Provenance Applications: Publications

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

  • Reproducible Research Fomel, Sergey; Claerbout, Jon F. CiSE Volume: 11 Issue: 1 Date: Jan.-Feb. 2009 Page(s): 5-7 Digital Object Identifier 10.1109/MCSE.2009.14

Provenance: Security and Privacy

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>


Storing Scientific Data

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Web schema matching and schema integration

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Thanh:

Avishek:


Some more papers

Some more papers on Dataspaces:

Presentation:

Querying Diverse Data

Relational data on the Web

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Pravin

Huong

  • [1] Information-theoretic tools for mining database structure from large data sets. Periklis Andritsos, Renee J. Miller and Panayiotis Tsaparas. SIGMOD 2004

Some More Papers

Presentation:

Data integration on the fly (or almost...)

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Zhan:

Additional papers:

Presentation PPT:

Usable query interfaces for structured data

Mark:

Komal:


Presentation:

Snippet Generation and Ranking

The Deep Web

Would like to present: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

Would like to critique: <<add your name and rate your preference from 1-10, 1=least interested, 10 = very interested>>

  • Google's Deep Web crawl. Jayant Madhavan, David Ko, Lucja Kot, Vignesh Ganapathy, Alex Rasmussen, Alon Y. Halevy. PVLDB 1(2): 1241-1252 (2008) (*Ramesh will present this)

Information Extraction

Zhan will present (long long paper, but only need to have an overview):

Parasaran will present:

Mark will present:

Thanh will present:

--- --- ---