| 2011 |
|---|
| 34 | Queries and materialized views on probabilistic databases. Nilesh N. Dalvi, Christopher Re, Dan Suciu. J. Comput. Syst. Sci. (77): 473-490 (2011). Web SearchBibTeXDownload |
| 33 | Sampling hidden objects using nearest-neighbor oracles. Nilesh N. Dalvi, Ravi Kumar, Ashwin Machanavajjhala, Vibhor Rastogi. KDD 2011, 1325-1333. Web SearchBibTeXDownload |
| 32 | Letter from the the Associate Editor. Ugur Çetintemel. PVLDB (5) (2011). Web SearchBibTeXDownload |
| 31 | Large-Scale Collective Entity Matching. Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofalakis. PVLDB (4): 208-218 (2011). Web SearchBibTeXDownload |
| 30 | Optimal Schemes for Robust Web Extraction. Aditya G. Parameswaran, Nilesh N. Dalvi, Hector Garcia-Molina, Rajeev Rastogi. PVLDB (4): 980-991 (2011). Web SearchBibTeXDownload |
| 29 | Automatic Wrappers for Large Scale Web Extraction. Nilesh N. Dalvi, Ravi Kumar, Mohamed A. Soliman. PVLDB (4): 219-230 (2011). Web SearchBibTeXDownload |
| 28 | Highly efficient algorithms for structural clustering of large websites. Lorenzo Blanco, Nilesh N. Dalvi, Ashwin Machanavajjhala. WWW 2011, 437-446. Web SearchBibTeXDownload |
| 2010 |
|---|
| 27 | Computing query probability with incidence algebras. Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu. PODS 2010, 203-214. Web SearchBibTeXDownload |
| 2009 |
|---|
| 26 | A translation model for matching reviews to objects. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins. CIKM 2009, 167-176. Cited by 2Web SearchBibTeXDownload |
| 25 | Probabilistic databases: diamonds in the dirt. Nilesh N. Dalvi, Christopher Ré, Dan Suciu. Commun. ACM (52): 86-94 (2009). Cited by 3Web SearchBibTeXDownload |
| 24 | Matching Reviews to Objects using a Language Model. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins. EMNLP 2009, 609-618. Web SearchBibTeXDownload |
| 23 | Uncertainty Management in Scientific Database Systems. Nilesh N. Dalvi. Encyclopedia of Database Systems 2009, 3225-3231. Web SearchBibTeXDownload |
| 22 | A web of concepts. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu. PODS 2009, 1-12. Web SearchBibTeXDownload |
| 21 | Robust web extraction: an approach based on a probabilistic tree-edit model. Nilesh N. Dalvi, Philip Bohannon, Fei Sha. SIGMOD Conference 2009, 335-348. Cited by 2Web SearchBibTeXDownload |
| 20 | Query Evaluation on a Database Given by a Random Graph. Nilesh N. Dalvi. Theory Comput. Syst. (44): 503-532 (2009). Web SearchBibTeXDownload |
| 2007 |
|---|
| 19 | Efficient Top-k Query Evaluation on Probabilistic Data. Christopher Re, Nilesh N. Dalvi, Dan Suciu. ICDE 2007, 886-895. Cited by 133Web SearchBibTeXDownload |
| 18 | Query Evaluation on a Database Given by a Random Graph. Nilesh N. Dalvi. ICDT 2007, 149-163. Web SearchBibTeXDownload |
| 17 | The dichotomy of conjunctive queries on probabilistic structures. Nilesh N. Dalvi, Dan Suciu. PODS 2007, 293-302. Cited by 35Web SearchBibTeXDownload |
| 16 | Management of probabilistic data: foundations and challenges. Nilesh N. Dalvi, Dan Suciu. PODS 2007, 1-12. Cited by 93Web SearchBibTeXDownload |
| 15 | Incorporating Uncertainty Metrics into a General-Purpose Data Integration System. Brenton Louie, Landon Detwiler, Nilesh N. Dalvi, Ron Shaker, Peter Tarczy-Hornoch, Dan Suciu. SSDBM 2007, 19. Cited by 4Web SearchBibTeXDownload |
| 14 | Efficient query evaluation on probabilistic databases. Nilesh N. Dalvi, Dan Suciu. VLDB J. (16): 523-544 (2007). Cited by 335Web SearchBibTeXDownload |
| 2006 |
|---|
| 13 | The Dichotomy of Conjunctive Queries on Probabilistic Structures. Nilesh N. Dalvi, Dan Suciu. CoRR (abs/cs/0612102) (2006). Web SearchBibTeXDownload |
| 12 | Robust Cardinality and Cost Estimation for Skyline Operator. Surajit Chaudhuri, Nilesh N. Dalvi, Raghav Kaushik. ICDE 2006, 64. Cited by 54Web SearchBibTeXDownload |
| 11 | Query Evaluation on Probabilistic Databases. Christopher Re, Nilesh N. Dalvi, Dan Suciu. IEEE Data Eng. Bull. (29): 25-31 (2006). Cited by 27Web SearchBibTeXDownload |
| 2005 |
|---|
| 10 | Asymptotic Conditional Probabilities for Conjunctive Queries. Nilesh N. Dalvi, Gerome Miklau, Dan Suciu. ICDT 2005, 289-305. Cited by 43Web SearchBibTeXDownload |
| 9 | Foundations of probabilistic answers to queries. Dan Suciu, Nilesh N. Dalvi. SIGMOD Conference 2005, 963. Cited by 34Web SearchBibTeXDownload |
| 8 | MYSTIQ: a system for finding more answers by using probabilities. Jihad Boulos, Nilesh N. Dalvi, Bhushan Mandhani, Shobhit Mathur, Christopher Ré, Dan Suciu. SIGMOD Conference 2005, 891-893. Cited by 72Web SearchBibTeXDownload |
| 7 | Answering Queries from Statistics and Probabilistic Views. Nilesh N. Dalvi, Dan Suciu. VLDB 2005, 805-816. Cited by 52Web SearchBibTeXDownload |
| 2004 |
|---|
| 6 | Adversarial classification. Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. Sanghai, Deepak Verma. KDD 2004, 99-108. Web SearchBibTeXDownload |
| 5 | Efficient Query Evaluation on Probabilistic Databases. Nilesh N. Dalvi, Dan Suciu. VLDB 2004, 864-875. Web SearchBibTeXDownload |
| 2003 |
|---|
| 4 | Pipelining in multi-query optimization. Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan. J. Comput. Syst. Sci. (66): 728-762 (2003). Web SearchBibTeXDownload |
| 3 | The Piazza peer data management project. Igor Tatarinov, Zachary G. Ives, Jayant Madhavan, Alon Y. Halevy, Dan Suciu, Nilesh N. Dalvi, Xin Dong, Yana Kadiyska, Gerome Miklau, Peter Mork. SIGMOD Record (32): 47-52 (2003). Cited by 147Web SearchBibTeXDownload |
| 2001 |
|---|
| 2 | Pipelining in Multi-Query Optimization. Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan. PODS 2001. Cited by 61Web SearchBibTeXDownload |
| 1 | Anti-aliased Hemicubes for Performance Improvements in Radiosity Solutions. Naga Kiran, Sudhir P. Mudur, Sharat Chandran, Nilesh N. Dalvi. WSCG 2001, 336-343. Web SearchBibTeXDownload |
