DBLife: Jeffrey F. Naughton

2013
162	On optimal differentially private mechanisms for count-range queries. Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton. ICDT 2013, 261-271. Web SearchBibTeXDownload
2012
161	GSLPI: A Cost-Based Query Progress Indicator. Jiexing Li, Rimma V. Nehme, Jeffrey F. Naughton. ICDE 2012, 678-689. Web SearchBibTeXDownload
160	Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. Chong Sun, Jeffrey F. Naughton, Siddharth Barman. ICDE 2012, 882-893. Web SearchBibTeXDownload
159	On differentially private frequent itemset mining. Chen Zeng, Jeffrey F. Naughton, Jin-Yi Cai. PVLDB (6): 25-36 (2012). Web SearchBibTeXDownload
158	Instrumenting a logic programming language to gather provenance from an information extraction application. Christine F. Reilly, Yueh-Hsuan Chiang, Jeffrey F. Naughton. WWW (Companion Volume) 2012, 589-590. Web SearchBibTeXDownload
2011
157	Preventing equivalence attacks in updated, anonymized data. Yeye He, Siddharth Barman, Jeffrey F. Naughton. ICDE 2011, 529-540. Web SearchBibTeXDownload
156	On the complexity of privacy-preserving complex event processing. Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton. PODS 2011, 165-174. Web SearchBibTeXDownload
155	Turbocharging DBMS buffer pool using SSDs. Jaeyoung Do, Donghui Zhang, Jignesh M. Patel, David J. DeWitt, Jeffrey F. Naughton, Alan Halverson. SIGMOD Conference 2011, 1113-1124. Web SearchBibTeXDownload
154	The Token Distribution Filter for Approximate String Membership. Chong Sun, Jeffrey F. Naughton. WebDB 2011. Web SearchBibTeXDownload
2010
153	Transaction reordering. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. Data Knowl. Eng. (69): 29-49 (2010). Web SearchBibTeXDownload
152	Impact of disk corruption on open-source DBMS. Sriram Subramanian, Yupu Zhang, Rajiv Vaidyanathan, Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Jeffrey F. Naughton. ICDE 2010, 509-520. Web SearchBibTeXDownload
151	Toward industrial-strength keyword search systems over relational data. Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Naughton. ICDE 2010, 717-720. Web SearchBibTeXDownload
150	DBMS: Lessons from the first 50 years, speculations for the next 50. Jeffrey F. Naughton. ICDE 2010, 2. Web SearchBibTeXDownload
149	Toward Scalable Keyword Search over Relational Data. Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Jeffrey F. Naughton. PVLDB (3): 140-149 (2010). Web SearchBibTeXDownload
2009
148	The Case for a Structured Approach to Managing Unstructured Data. AnHai Doan, Jeffrey F. Naughton, Akanksha Baid, Xiaoyong Chai, Fei Chen, Ting Chen, Eric Chu, Pedro DeRose, Byron J. Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong. CIDR 2009. Cited by 2Web SearchBibTeXDownload
147	Anonymization of Set-Valued Data via Top-Down, Local Generalization. Yeye He, Jeffrey F. Naughton. PVLDB (2): 934-945 (2009). Web SearchBibTeXDownload
146	Combining keyword search and forms for ad hoc querying of databases. Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan, Jeffrey F. Naughton. SIGMOD Conference 2009, 349-360. Cited by 1Web SearchBibTeXDownload
145	Efficiently incorporating user feedback into information extraction and integration programs. Xiaoyong Chai, Ba-Quy Vuong, AnHai Doan, Jeffrey F. Naughton. SIGMOD Conference 2009, 87-100. Web SearchBibTeXDownload
144	On energy management, load balancing and replication. Willis Lang, Jignesh M. Patel, Jeffrey F. Naughton. SIGMOD Record (38): 35-42 (2009). Web SearchBibTeXDownload
143	Transparently Gathering Provenance with Provenance Aware Condor. Christine F. Reilly, Jeffrey F. Naughton. Workshop on the Theory and Practice of Provenance 2009. Cited by 1Web SearchBibTeXDownload
2008
142	Transaction reordering with application to synchronized scans. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. DOLAP 2008, 17-24. Cited by 1Web SearchBibTeXDownload
141	Issues in applying data mining to grid job failure detection and diagnosis. Lakshmikant Shrinivas, Jeffrey F. Naughton. HPDC 2008, 239-240. Cited by 2Web SearchBibTeXDownload
140	Schema Matching Using Interattribute Dependencies. Jaewoo Kang, Jeffrey F. Naughton. IEEE Trans. Knowl. Data Eng. (20): 1393-1407 (2008). Web SearchBibTeXDownload
139	On the provenance of non-answers to queries over extracted data. Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F. Naughton. PVLDB (1): 736-747 (2008). Cited by 6Web SearchBibTeXDownload
138	Clustera: an integrated computation and data management system. David J. DeWitt, Erik Paulson, Eric Robinson, Jeffrey F. Naughton, Joshua Royalty, Srinath Shankar, Andrew Krioukov. PVLDB (1): 28-41 (2008). Cited by 19Web SearchBibTeXDownload
137	Information extraction challenges in managing unstructured data. AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan, Akanksha Baid, Xiaoyong Chai, Fei Chen, Ting Chen, Eric Chu, Pedro DeRose, Byron J. Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong. SIGMOD Record (37): 14-20 (2008). Cited by 3Web SearchBibTeXDownload
136	Form-based proxy caching for database-backed web sites: keywords and functions. Qiong Luo, Jeffrey F. Naughton, Wenwei Xue. VLDB J. (17): 489-513 (2008). Cited by 1Web SearchBibTeXDownload
2007
135	K-relevance: a spectrum of relevance for data sources impacting a query. Jiansheng Huang, Jeffrey F. Naughton. SIGMOD Conference 2007, 163-174. Web SearchBibTeXDownload
134	The case for a wide-table approach to manage sparse relational data sets. Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughton. SIGMOD Conference 2007, 821-832. Cited by 14Web SearchBibTeXDownload
133	Database Support for Weighted Match Joins. Ameet Kini, Jeffrey F. Naughton. SSDBM 2007, 20. Web SearchBibTeXDownload
132	K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization. Tochukwu Iwuchukwu, Jeffrey F. Naughton, AnHai Doan. VLDB 2007, 746-757. Cited by 24Web SearchBibTeXDownload
131	Declarative Information Extraction Using Datalog with Embedded Extraction Predicates. Warren Shen, AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan. VLDB 2007, 1033-1044. Cited by 34Web SearchBibTeXDownload
130	A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data. Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Jeffrey F. Naughton. VLDB 2007, 1045-1056. Cited by 15Web SearchBibTeXDownload
2006
129	Transaction Reordering and Grouping for Continuous Data Loading. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. BIRTE 2006, 34-49. Cited by 3Web SearchBibTeXDownload
128	Multi-query SQL Progress Indicators. Gang Luo, Jeffrey F. Naughton, Philip S. Yu. EDBT 2006, 921-941. Cited by 19Web SearchBibTeXDownload
127	Approximating StreamingWindow Joins Under CPU Limitations. Ahmed Ayad, Jeffrey F. Naughton, Stephen Wright, Utkarsh Srivastava. ICDE 2006, 142. Cited by 11Web SearchBibTeXDownload
126	Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format. Jennifer L. Beckmann, Alan Halverson, Rajasekar Krishnamurthy, Jeffrey F. Naughton. ICDE 2006, 58. Cited by 32Web SearchBibTeXDownload
125	End-biased Samples for Join Cardinality Estimation. Cristian Estan, Jeffrey F. Naughton. ICDE 2006, 20. Cited by 10Web SearchBibTeXDownload
124	Exploring Provenance in a Distributed Job Execution System. Christine F. Reilly, Jeffrey F. Naughton. IPAW 2006, 237-245. Cited by 11Web SearchBibTeXDownload
123	Database support for matching: limitations and opportunities. Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, David J. DeWitt. SIGMOD Conference 2006, 85-96. Cited by 6Web SearchBibTeXDownload
122	TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources. Jiansheng Huang, Jeffrey F. Naughton, Miron Livny. VLDB 2006, 223-234. Cited by 1Web SearchBibTeXDownload
2005
121	Synopses for query optimization: A space-complexity perspective. Raghav Kaushik, Jeffrey F. Naughton, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy. ACM Trans. Database Syst. (30): 1102-1127 (2005). Cited by 2Web SearchBibTeXDownload
120	The Lowell database research self-assessment. Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik. Commun. ACM (48): 111-118 (2005). Cited by 2Web SearchBibTeXDownload
119	Increasing the Accuracy and Coverage of SQL Progress Indicators. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. ICDE 2005, 853-864. Cited by 24Web SearchBibTeXDownload
118	XML Views as Integrity Constraints and their Use in Query Translation. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. ICDE 2005, 693-704. Cited by 3Web SearchBibTeXDownload
117	Locking Protocols for Materialized Aggregate Join Views. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. IEEE Trans. Knowl. Data Eng. (17): 796-807 (2005). Cited by 9Web SearchBibTeXDownload
116	Integrating databases and workflow systems. Srinath Shankar, Ameet Kini, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Record (34): 5-11 (2005). Cited by 26Web SearchBibTeXDownload
2004
115	Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation. Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton. ICDE 2004, 42-53. Cited by 51Web SearchBibTeXDownload
114	On the Integration of Structure Indexes and Inverted Lists. Raghav Kaushik, Rajasekar Krishnamurthy, Jeffrey F. Naughton, Raghu Ramakrishnan. SIGMOD Conference 2004, 779-790. Cited by 125Web SearchBibTeXDownload
113	Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams. Ahmed Ayad, Jeffrey F. Naughton. SIGMOD Conference 2004, 419-430. Cited by 66Web SearchBibTeXDownload
112	Toward a Progress Indicator for Database Queries. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. SIGMOD Conference 2004, 791-802. Cited by 48Web SearchBibTeXDownload
111	Efficient XML-to-SQL Query Translation: Where to Add the Intelligence?. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. VLDB 2004, 144-155. Cited by 44Web SearchBibTeXDownload
110	Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. WebDB 2004, 49-54. Cited by 4Web SearchBibTeXDownload
2003
109	Building XML statistics for the hidden web. Ashraf Aboulnaga, Jeffrey F. Naughton. CIKM 2003, 358-365. Cited by 9Web SearchBibTeXDownload
108	The Lowell Database Research Self Assessment. Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik. CoRR (cs.DB/0310006) (2003). Web SearchBibTeXDownload
107	A Comparison of Three Methods for Join View Maintenance in Parallel RDBMS. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. ICDE 2003, 177-188. Cited by 10Web SearchBibTeXDownload
106	Evaluating Window Joins over Unbounded Streams. Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas. ICDE 2003, 341-352. Cited by 267Web SearchBibTeXDownload
105	On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton. ICDT 2003, 267-281. Cited by 17Web SearchBibTeXDownload
104	On Relational Support for XML Publishing: Beyond Sorting and Tagging. Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naughton. SIGMOD Conference 2003, 611-622. Cited by 27Web SearchBibTeXDownload
103	On Schema Matching with Opaque Column Names and Data Values. Jaewoo Kang, Jeffrey F. Naughton. SIGMOD Conference 2003, 205-216. Cited by 123Web SearchBibTeXDownload
102	Reminiscences an Influential Papers. Kenneth A. Ross, Minos N. Garofalakis, Jeffrey F. Naughton. SIGMOD Record (32): 62-63 (2003). Web SearchBibTeXDownload
101	Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. Stratis Viglas, Jeffrey F. Naughton, Josef Burger. VLDB 2003, 285-296. Cited by 147Web SearchBibTeXDownload
100	Locking Protocols for Materialized Aggregate Join Views. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. VLDB 2003, 596-607. Cited by 9Web SearchBibTeXDownload
99	Mixed Mode XML Query Processing. Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis Viglas, Yuan Wang, Jeffrey F. Naughton, David J. DeWitt. VLDB 2003, 225-236. Cited by 85Web SearchBibTeXDownload
98	XML-SQL Query Translation Literature: The State of the Art and Open Problems. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. Xsym 2003, 1-18. Cited by 107Web SearchBibTeXDownload
2002
97	A Non-Blocking Parallel Spatial Join Algorithm. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann. ICDE 2002, 697-705. Cited by 23Web SearchBibTeXDownload
96	Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries. Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton. ICDE 2002, 345-356. Cited by 84Web SearchBibTeXDownload
95	Covering indexes for branching path queries. Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth. SIGMOD Conference 2002, 133-144. Cited by 228Web SearchBibTeXDownload
94	A scalable hash ripple join algorithm. Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey F. Naughton. SIGMOD Conference 2002, 252-262. Cited by 23Web SearchBibTeXDownload
93	Middle-tier database caching for e-business. Qiong Luo, Sailesh Krishnamurthy, C. Mohan, Hamid Pirahesh, Honguk Woo, Bruce G. Lindsay, Jeffrey F. Naughton. SIGMOD Conference 2002, 600-611. Cited by 127Web SearchBibTeXDownload
92	Rate-based query optimization for streaming information sources. Stratis Viglas, Jeffrey F. Naughton. SIGMOD Conference 2002, 37-48. Cited by 215Web SearchBibTeXDownload
91	Updates for Structure Indexes. Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Pradeep Shenoy. VLDB 2002, 239-250. Cited by 40Web SearchBibTeXDownload
2001
90	The Niagara Internet Query System. Jeffrey F. Naughton, David J. DeWitt, David Maier, Ashraf Aboulnaga, Jianjun Chen, Leonidas Galanis, Jaewoo Kang, Rajasekar Krishnamurthy, Qiong Luo, Naveen Prakash, Ravishankar Ramamurthy, Jayavel Shanmugasundaram, Feng Tian, Kristin Tufte, Stratis Viglas, Yuan Wang, Chun Zhang, Bruce Jackson, Anurag Kumar Gupta, Rushan Chen. IEEE Data Eng. Bull. (24): 27-33 (2001). Cited by 165Web SearchBibTeXDownload
89	On the Complexity of Join Predicates. Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton. PODS 2001. Cited by 13Web SearchBibTeXDownload
88	On Supporting Containment Queries in Relational Database Management Systems. Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, Qiong Luo, Guy M. Lohman. SIGMOD Conference 2001, 425-436. Cited by 655Web SearchBibTeXDownload
87	A General Techniques for Querying XML Documents using a Relational Database System. Jayavel Shanmugasundaram, Eugene J. Shekita, Jerry Kiernan, Rajasekar Krishnamurthy, Stratis Viglas, Jeffrey F. Naughton, Igor Tatarinov. SIGMOD Record (30): 20-26 (2001). Cited by 117Web SearchBibTeXDownload
86	Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. Ashraf Aboulnaga, Alaa R. Alameldeen, Jeffrey F. Naughton. VLDB 2001, 591-600. Cited by 173Web SearchBibTeXDownload
85	Form-Based Proxy Caching for Database-Backed Web Sites. Qiong Luo, Jeffrey F. Naughton. VLDB 2001, 191-200. Cited by 100Web SearchBibTeXDownload
84	Generating Synthetic Complex-Structured XML Data. Ashraf Aboulnaga, Jeffrey F. Naughton, Chun Zhang. WebDB 2001, 79-84. Cited by 44Web SearchBibTeX
2000
83	Materialized View Selection for Multi-Cube Data Models. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton. EDBT 2000, 269-284. Cited by 23Web SearchBibTeXDownload
82	Aggregate Aware Caching for Multi-Dimensional Queries. Prasad Deshpande, Jeffrey F. Naughton. EDBT 2000, 167-182. Cited by 22Web SearchBibTeXDownload
81	Accurate Estimation of the Cost of Spatial Selections. Ashraf Aboulnaga, Jeffrey F. Naughton. ICDE 2000, 123-134. Cited by 47Web SearchBibTeXDownload
80	SIGMOD'2000 Program Chair's Message. Jeffrey F. Naughton. SIGMOD Record (29): 10-11 (2000). Web SearchBibTeXDownload
79	Set Containment Joins: The Good, The Bad and The Ugly. Karthikeyan Ramasamy, Jignesh M. Patel, Jeffrey F. Naughton, Raghav Kaushik. VLDB 2000, 351-362. Cited by 40Web SearchBibTeXDownload
78	Architecting a Network Query Engine for Producing Partial Results. Jayavel Shanmugasundaram, Kristin Tufte, David J. DeWitt, Jeffrey F. Naughton, David Maier. WebDB (Informal Proceedings) 2000, 17-22. Cited by 46Web SearchBibTeXDownload
77	Active Query Caching for Database Web Servers. Qiong Luo, Jeffrey F. Naughton, Rajasekar Krishnamurthy, Pei Cao, Yunrui Li. WebDB (Informal Proceedings) 2000, 29-34. Cited by 67Web SearchBibTeXDownload
1999
76	Relational Databases for Querying XML Documents: Limitations and Opportunities. Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhang, Gang He, David J. DeWitt, Jeffrey F. Naughton. VLDB 1999, 302-314. Cited by 1077Web SearchBibTeXDownload
1998
75	The Asilomar Report on Database Research. Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman. CoRR (cs.DB/9811013): 74-80 (1998). Cited by 236Web SearchBibTeXDownload
74	Guest Editors' Introduction. Carolyn McGregor, Anthony Maedel, Laurence Tianruo Yang, Sanjay Goel, Alexander Zelikovsky. Distributed and Parallel Databases (6): 5-6 (1998). Cited by 2Web SearchBibTeXDownload
73	Remote Load-Sensitive Caching for Multi-Server Database Systems. Shivakumar Venkataraman, Jeffrey F. Naughton, Miron Livny. ICDE 1998, 514-521. Cited by 12Web SearchBibTeXDownload
72	Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Databases Systems. Yihong Zhao, Karthikeyan Ramasamy, Kristin Tufte, Jeffrey F. Naughton. ICDE 1998, 241-249. Cited by 22Web SearchBibTeXDownload
71	Caching Multidimensional Queries Using Chunks. Prasad Deshpande, Karthikeyan Ramasamy, Amit Shukla, Jeffrey F. Naughton. SIGMOD Conference 1998, 259-270. Cited by 182Web SearchBibTeXDownload
70	Simultaneous Optimization and Evaluation of Multiple Dimensional Queries. Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton, Amit Shukla. SIGMOD Conference 1998, 271-282. Cited by 66Web SearchBibTeXDownload
69	Materialized View Selection for Multidimensional Datasets. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton. VLDB 1998, 488-499. Cited by 200Web SearchBibTeXDownload
1997
68	Memory Management for Scalable Web Data Servers. Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton. ICDE 1997, 510-519. Cited by 13Web SearchBibTeXDownload
67	Cubing Algorithms, Storage Estimation, and Storage and Processing Alternatives for OLAP. Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy, Amit Shukla, Kristin Tufte, Yihong Zhao. IEEE Data Eng. Bull. (20): 3-11 (1997). Web SearchBibTeXDownload
66	The BUCKY Object-Relational Benchmark (Experience Paper). Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes Gehrke, Dhaval Shah. SIGMOD Conference 1997, 135-146. Cited by 68Web SearchBibTeXDownload
65	Building a Scaleable Geo-Spatial DBMS: Technology, Implementation, and Evaluation. Jignesh M. Patel, Jie-Bing Yu, Navin Kabra, Kristin Tufte, Biswadeep Nag, Josef Burger, Nancy E. Hall, Karthikeyan Ramasamy, Roger Lueder, Curt J. Ellmann, Jim Kupsch, Shelly Guo, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Conference 1997, 336-347. Cited by 106Web SearchBibTeXDownload
64	An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton. SIGMOD Conference 1997, 159-170. Cited by 399Web SearchBibTeXDownload
1996
63	Selectivity and Cost Estimation for Joins Based on Random Sampling. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami. J. Comput. Syst. Sci. (52): 550-569 (1996). Cited by 58Web SearchBibTeXDownload
62	Query Execution Techniques for Caching Expensive Methods. Joseph M. Hellerstein, Jeffrey F. Naughton. SIGMOD Conference 1996, 423-434. Cited by 87Web SearchBibTeXDownload
61	Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy. VLDB 1996, 522-531. Cited by 205Web SearchBibTeXDownload
60	On the Computation of Multidimensional Aggregates. Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi. VLDB 1996, 506-521. Cited by 584Web SearchBibTeXDownload
59	Parallelising OODBMS Traversals: A Performance Evaluation. David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman. VLDB J. (5): 3-18 (1996). Web SearchBibTeXDownload
1995
58	Space Optimization in Deductive Databases. Divesh Srivastava, S. Sudarshan, Raghu Ramakrishnan, Jeffrey F. Naughton. ACM Trans. Database Syst. (20): 472-516 (1995). Cited by 3Web SearchBibTeXDownload
57	The Impact of Data Placement on Memory Management for Multi-Server OODBMS. Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton. ICDE 1995, 355-364. Cited by 9Web SearchBibTeXDownload
56	Query Size Estimation by Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton. J. Comput. Syst. Sci. (51): 18-25 (1995). Cited by 125Web SearchBibTeXDownload
55	On the Expected Size of Recursive Datalog Queries. S. Seshadri, Jeffrey F. Naughton. J. Comput. Syst. Sci. (51): 137-148 (1995). Cited by 8Web SearchBibTeXDownload
54	Adaptive Parallel Aggregation Algorithms. Ambuj Shatdal, Jeffrey F. Naughton. SIGMOD Conference 1995, 104-114. Cited by 87Web SearchBibTeXDownload
53	Argument Reduction by Factoring. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. Theor. Comput. Sci. (146): 269-310 (1995). Cited by 86Web SearchBibTeXDownload
52	OODB Bulk Loading Revisited: The Partitioned-List Approach. Janet L. Wiener, Jeffrey F. Naughton. VLDB 1995, 30-41. Cited by 32Web SearchBibTeXDownload
51	Sampling-Based Estimation of the Number of Distinct Values of an Attribute. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Lynne Stokes. VLDB 1995, 311-322. Cited by 208Web SearchBibTeXDownload
50	Generalized Search Trees for Database Systems. Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer. VLDB 1995, 562-573. Cited by 395Web SearchBibTeXDownload
1994
49	Storage Reclamation and Reorganization in Client-Server Persistent Object Stores. Voon-Fee Yong, Jeffrey F. Naughton, Jie-Bing Yu. ICDE 1994, 120-131. Cited by 60Web SearchBibTeXDownload
48	Low-Latency, Concurrent Checkpointing for Parallel Programs. Kai Li, Jeffrey F. Naughton, James S. Plank. IEEE Trans. Parallel Distrib. Syst. (5): 874-879 (1994). Web SearchBibTeXDownload
47	How to Forget the Past Without Repeating It. Jeffrey F. Naughton, Raghu Ramakrishnan. J. ACM (41): 1151-1177 (1994). Cited by 12Web SearchBibTeXDownload
46	A Status Report on the oo7 OODBMS Benchmarking Effort. Michael J. Carey, David J. DeWitt, Chander Kant, Jeffrey F. Naughton. OOPSLA 1994, 414-426. Cited by 63Web SearchBibTeXDownload
45	ParSets for Parallelizing OODBMS Traversals: Implementation and Performance. David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman. PDIS 1994, 111-120. Cited by 13Web SearchBibTeXDownload
44	On the Relative Cost of Sampling for Join Selectivity Estimation. Peter J. Haas, Jeffrey F. Naughton, Arun N. Swami. PODS 1994, 14-24. Cited by 34Web SearchBibTeXDownload
43	Shoring Up Persistent Applications. Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling. SIGMOD Conference 1994, 383-394. Cited by 446Web SearchBibTeXDownload
42	Bulk Loading into an OODB: A Performance Study. Janet L. Wiener, Jeffrey F. Naughton. VLDB 1994, 120-131. Cited by 23Web SearchBibTeXDownload
41	Cache Conscious Algorithms for Relational Query Processing. Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton. VLDB 1994, 510-521. Cited by 151Web SearchBibTeXDownload
1993
40	Clocked Adversaries for Hashing. Richard J. Lipton, Jeffrey F. Naughton. Algorithmica (9): 239-252 (1993). Cited by 10Web SearchBibTeXDownload
39	The oo7 Benchmark: Current Status & Future Directions. Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton. HPTS 1993. Cited by 1Web SearchBibTeX
38	Nested Loops Revisited. David J. DeWitt, Jeffrey F. Naughton, Joseph Burger. PDIS 1993, 230-242. Cited by 21Web SearchBibTeXDownload
37	Fixed-Precision Estimation of Join Selectivity. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami. PODS 1993, 190-201. Cited by 34Web SearchBibTeXDownload
36	The oo7 Benchmark. Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Conference 1993, 12-21. Cited by 365Web SearchBibTeXDownload
35	Using Shared Virtual Memory for Parallel Join Processing. Ambuj Shatdal, Jeffrey F. Naughton. SIGMOD Conference 1993, 119-128. Cited by 38Web SearchBibTeXDownload
34	Efficient Sampling Strategies for Relational Database Operations. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri. Theor. Comput. Sci. (116): 195-226 (1993). Cited by 71Web SearchBibTeXDownload
1992
33	Sampling Issues in Parallel Database Systems. S. Seshadri, Jeffrey F. Naughton. EDBT 1992, 328-343. Cited by 29Web SearchBibTeXDownload
32	On the Performance of Object Clustering Techniques. Manolis M. Tsangaris, Jeffrey F. Naughton. SIGMOD Conference 1992, 144-153. Cited by 115Web SearchBibTeXDownload
31	Practical Skew Handling in Parallel Joins. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri. VLDB 1992, 27-40. Cited by 172Web SearchBibTeXDownload
1991
30	Bottom-Up Evaluation of Logic Programs. Jeffrey F. Naughton, Raghu Ramakrishnan. Computational Logic - Essays in Honor of Alan Robinson 1991, 640-700. Cited by 39Web SearchBibTeX
29	An efficient checkpointing method for multicomputers with wormhole routing. Kai Li, Jeffrey F. Naughton, James S. Plank. International Journal of Parallel Programming (20): 159-180 (1991). Web SearchBibTeXDownload
28	One-Sided Recursions. Jeffrey F. Naughton. J. Comput. Syst. Sci. (42): 199-236 (1991). Cited by 55Web SearchBibTeXDownload
27	A Counting Algorithm for a Cyclic Binary Query. Ramsey W. Haddad, Jeffrey F. Naughton. J. Comput. Syst. Sci. (43): 145-169 (1991). Cited by 8Web SearchBibTeXDownload
26	A Simple Characterization of Uniform Boundedness for a Class of Recursions. Jeffrey F. Naughton, Yehoshua Sagiv. J. Log. Program. (10): 233-252 (1991). Cited by 6Web SearchBibTeXDownload
25	Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider. PDIS 1991, 280-291. Cited by 134Web SearchBibTeXDownload
24	On the Expected Size of Recursive Datalog Queries. S. Seshadri, Jeffrey F. Naughton. PODS 1991, 268-279. Cited by 8Web SearchBibTeXDownload
23	Space Optimization in the Bottom-Up Evaluation of Logic Programs. S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan, Jeffrey F. Naughton. SIGMOD Conference 1991, 68-77. Cited by 7Web SearchBibTeXDownload
22	A Stochastic Approach for Clustering in Object Bases. Manolis M. Tsangaris, Jeffrey F. Naughton. SIGMOD Conference 1991, 12-21. Cited by 92Web SearchBibTeXDownload
21	Checkpointing Multicomputer Applications. Kai Li, Jeffrey F. Naughton, James S. Plank. SRDS 1991, 2-11. Cited by 84Web SearchBibTeX
20	An Evaluation of Non-Equijoin Algorithms. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider. VLDB 1991, 443-452. Cited by 138Web SearchBibTeXDownload
1990
19	On Estimating the Size of Projections. Jeffrey F. Naughton, S. Seshadri. ICDT 1990, 499-513. Cited by 33Web SearchBibTeXDownload
18	Query Size Estimation by Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton. PODS 1990, 40-46. Cited by 125Web SearchBibTeXDownload
17	Real-Time, Concurrent Checkpoint for Parallel Programs. Kai Li, Jeffrey F. Naughton, James S. Plank. PPOPP 1990, 79-88. Cited by 103Web SearchBibTeXDownload
16	Practical Selectivity Estimation through Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider. SIGMOD Conference 1990, 1-11. Cited by 233Web SearchBibTeXDownload
15	How to Forget the Past Without Repeating It. Jeffrey F. Naughton, Raghu Ramakrishnan. VLDB 1990, 278-289. Cited by 12Web SearchBibTeXDownload
1989
14	Minimizing function-free recursive inference rules. Jeffrey F. Naughton. J. ACM (36): 69-91 (1989). Cited by 22Web SearchBibTeXDownload
13	Data Independent Recursion in Deductive Databases. Jeffrey F. Naughton. J. Comput. Syst. Sci. (38): 259-289 (1989). Cited by 83Web SearchBibTeXDownload
12	Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. SIGMOD Conference 1989, 235-242. Cited by 90Web SearchBibTeXDownload
11	Argument Reduction by Factoring. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. VLDB 1989, 173-182. Cited by 86Web SearchBibTeXDownload
10	Estimating the Size of Generalized Transitive Closures. Richard J. Lipton, Jeffrey F. Naughton. VLDB 1989, 165-171. Cited by 56Web SearchBibTeXDownload
1988
9	Multiprocessor Main Memory Transaction Processing. Kai Li, Jeffrey F. Naughton. DPDS 1988, 177-187. Cited by 31Web SearchBibTeX
8	Counting Methods for Cyclic Relations. Ramsey W. Haddad, Jeffrey F. Naughton. PODS 1988, 333-340. Cited by 36Web SearchBibTeXDownload
7	Compiling Separable Recursions. Jeffrey F. Naughton. SIGMOD Conference 1988, 312-319. Cited by 31Web SearchBibTeXDownload
1987
6	YAWN! (Yet Another Window on NAIL!). Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder. IEEE Data Eng. Bull. (10): 28-43 (1987). Cited by 32Web SearchBibTeXDownload
5	A Decidable Class of Bounded Recursions. Jeffrey F. Naughton, Yehoshua Sagiv. PODS 1987, 227-236. Cited by 60Web SearchBibTeXDownload
4	One-Sided Recursions. Jeffrey F. Naughton. PODS 1987, 340-348. Cited by 55Web SearchBibTeXDownload
1986
3	Data Independent Recursion in Deductive Databases. Jeffrey F. Naughton. PODS 1986, 267-279. Cited by 83Web SearchBibTeXDownload
2	Redundancy in Function-Free Recursive Rules. Jeffrey F. Naughton. SLP 1986, 236-245. Web SearchBibTeX
1	One-Sided Recursions. Jeffrey F. Naughton. XP7.52 Workshop on Database Theory 1986. Cited by 55Web SearchBibTeX

2013

162

On optimal differentially private mechanisms for count-range queries. Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton. ICDT 2013, 261-271. Web SearchBibTeXDownload

2012

161

GSLPI: A Cost-Based Query Progress Indicator. Jiexing Li, Rimma V. Nehme, Jeffrey F. Naughton. ICDE 2012, 678-689. Web SearchBibTeXDownload

160

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. Chong Sun, Jeffrey F. Naughton, Siddharth Barman. ICDE 2012, 882-893. Web SearchBibTeXDownload

159

On differentially private frequent itemset mining. Chen Zeng, Jeffrey F. Naughton, Jin-Yi Cai. PVLDB (6): 25-36 (2012). Web SearchBibTeXDownload

158

Instrumenting a logic programming language to gather provenance from an information extraction application. Christine F. Reilly, Yueh-Hsuan Chiang, Jeffrey F. Naughton. WWW (Companion Volume) 2012, 589-590. Web SearchBibTeXDownload

2011

157

Preventing equivalence attacks in updated, anonymized data. Yeye He, Siddharth Barman, Jeffrey F. Naughton. ICDE 2011, 529-540. Web SearchBibTeXDownload

156

On the complexity of privacy-preserving complex event processing. Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton. PODS 2011, 165-174. Web SearchBibTeXDownload

155

Turbocharging DBMS buffer pool using SSDs. Jaeyoung Do, Donghui Zhang, Jignesh M. Patel, David J. DeWitt, Jeffrey F. Naughton, Alan Halverson. SIGMOD Conference 2011, 1113-1124. Web SearchBibTeXDownload

154

The Token Distribution Filter for Approximate String Membership. Chong Sun, Jeffrey F. Naughton. WebDB 2011. Web SearchBibTeXDownload

2010

153

Transaction reordering. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. Data Knowl. Eng. (69): 29-49 (2010). Web SearchBibTeXDownload

152

Impact of disk corruption on open-source DBMS. Sriram Subramanian, Yupu Zhang, Rajiv Vaidyanathan, Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Jeffrey F. Naughton. ICDE 2010, 509-520. Web SearchBibTeXDownload

151

Toward industrial-strength keyword search systems over relational data. Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Naughton. ICDE 2010, 717-720. Web SearchBibTeXDownload

150

DBMS: Lessons from the first 50 years, speculations for the next 50. Jeffrey F. Naughton. ICDE 2010, 2. Web SearchBibTeXDownload

149

Toward Scalable Keyword Search over Relational Data. Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Jeffrey F. Naughton. PVLDB (3): 140-149 (2010). Web SearchBibTeXDownload

2009

148

The Case for a Structured Approach to Managing Unstructured Data. AnHai Doan, Jeffrey F. Naughton, Akanksha Baid, Xiaoyong Chai, Fei Chen, Ting Chen, Eric Chu, Pedro DeRose, Byron J. Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong. CIDR 2009. Cited by 2Web SearchBibTeXDownload

147

Anonymization of Set-Valued Data via Top-Down, Local Generalization. Yeye He, Jeffrey F. Naughton. PVLDB (2): 934-945 (2009). Web SearchBibTeXDownload

146

Combining keyword search and forms for ad hoc querying of databases. Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan, Jeffrey F. Naughton. SIGMOD Conference 2009, 349-360. Cited by 1Web SearchBibTeXDownload

145

Efficiently incorporating user feedback into information extraction and integration programs. Xiaoyong Chai, Ba-Quy Vuong, AnHai Doan, Jeffrey F. Naughton. SIGMOD Conference 2009, 87-100. Web SearchBibTeXDownload

144

On energy management, load balancing and replication. Willis Lang, Jignesh M. Patel, Jeffrey F. Naughton. SIGMOD Record (38): 35-42 (2009). Web SearchBibTeXDownload

143

Transparently Gathering Provenance with Provenance Aware Condor. Christine F. Reilly, Jeffrey F. Naughton. Workshop on the Theory and Practice of Provenance 2009. Cited by 1Web SearchBibTeXDownload

2008

142

Transaction reordering with application to synchronized scans. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. DOLAP 2008, 17-24. Cited by 1Web SearchBibTeXDownload

141

Issues in applying data mining to grid job failure detection and diagnosis. Lakshmikant Shrinivas, Jeffrey F. Naughton. HPDC 2008, 239-240. Cited by 2Web SearchBibTeXDownload

140

Schema Matching Using Interattribute Dependencies. Jaewoo Kang, Jeffrey F. Naughton. IEEE Trans. Knowl. Data Eng. (20): 1393-1407 (2008). Web SearchBibTeXDownload

139

On the provenance of non-answers to queries over extracted data. Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F. Naughton. PVLDB (1): 736-747 (2008). Cited by 6Web SearchBibTeXDownload

138

Clustera: an integrated computation and data management system. David J. DeWitt, Erik Paulson, Eric Robinson, Jeffrey F. Naughton, Joshua Royalty, Srinath Shankar, Andrew Krioukov. PVLDB (1): 28-41 (2008). Cited by 19Web SearchBibTeXDownload

137

Information extraction challenges in managing unstructured data. AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan, Akanksha Baid, Xiaoyong Chai, Fei Chen, Ting Chen, Eric Chu, Pedro DeRose, Byron J. Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong. SIGMOD Record (37): 14-20 (2008). Cited by 3Web SearchBibTeXDownload

136

Form-based proxy caching for database-backed web sites: keywords and functions. Qiong Luo, Jeffrey F. Naughton, Wenwei Xue. VLDB J. (17): 489-513 (2008). Cited by 1Web SearchBibTeXDownload

2007

135

K-relevance: a spectrum of relevance for data sources impacting a query. Jiansheng Huang, Jeffrey F. Naughton. SIGMOD Conference 2007, 163-174. Web SearchBibTeXDownload

134

The case for a wide-table approach to manage sparse relational data sets. Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughton. SIGMOD Conference 2007, 821-832. Cited by 14Web SearchBibTeXDownload

133

Database Support for Weighted Match Joins. Ameet Kini, Jeffrey F. Naughton. SSDBM 2007, 20. Web SearchBibTeXDownload

132

K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization. Tochukwu Iwuchukwu, Jeffrey F. Naughton, AnHai Doan. VLDB 2007, 746-757. Cited by 24Web SearchBibTeXDownload

131

Declarative Information Extraction Using Datalog with Embedded Extraction Predicates. Warren Shen, AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan. VLDB 2007, 1033-1044. Cited by 34Web SearchBibTeXDownload

130

A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data. Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Jeffrey F. Naughton. VLDB 2007, 1045-1056. Cited by 15Web SearchBibTeXDownload

2006

129

Transaction Reordering and Grouping for Continuous Data Loading. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. BIRTE 2006, 34-49. Cited by 3Web SearchBibTeXDownload

128

Multi-query SQL Progress Indicators. Gang Luo, Jeffrey F. Naughton, Philip S. Yu. EDBT 2006, 921-941. Cited by 19Web SearchBibTeXDownload

127

Approximating StreamingWindow Joins Under CPU Limitations. Ahmed Ayad, Jeffrey F. Naughton, Stephen Wright, Utkarsh Srivastava. ICDE 2006, 142. Cited by 11Web SearchBibTeXDownload

126

Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format. Jennifer L. Beckmann, Alan Halverson, Rajasekar Krishnamurthy, Jeffrey F. Naughton. ICDE 2006, 58. Cited by 32Web SearchBibTeXDownload

125

End-biased Samples for Join Cardinality Estimation. Cristian Estan, Jeffrey F. Naughton. ICDE 2006, 20. Cited by 10Web SearchBibTeXDownload

124

Exploring Provenance in a Distributed Job Execution System. Christine F. Reilly, Jeffrey F. Naughton. IPAW 2006, 237-245. Cited by 11Web SearchBibTeXDownload

123

Database support for matching: limitations and opportunities. Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, David J. DeWitt. SIGMOD Conference 2006, 85-96. Cited by 6Web SearchBibTeXDownload

122

TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources. Jiansheng Huang, Jeffrey F. Naughton, Miron Livny. VLDB 2006, 223-234. Cited by 1Web SearchBibTeXDownload

2005

121

Synopses for query optimization: A space-complexity perspective. Raghav Kaushik, Jeffrey F. Naughton, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy. ACM Trans. Database Syst. (30): 1102-1127 (2005). Cited by 2Web SearchBibTeXDownload

120

The Lowell database research self-assessment. Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik. Commun. ACM (48): 111-118 (2005). Cited by 2Web SearchBibTeXDownload

119

Increasing the Accuracy and Coverage of SQL Progress Indicators. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. ICDE 2005, 853-864. Cited by 24Web SearchBibTeXDownload

118

XML Views as Integrity Constraints and their Use in Query Translation. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. ICDE 2005, 693-704. Cited by 3Web SearchBibTeXDownload

117

Locking Protocols for Materialized Aggregate Join Views. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. IEEE Trans. Knowl. Data Eng. (17): 796-807 (2005). Cited by 9Web SearchBibTeXDownload

116

Integrating databases and workflow systems. Srinath Shankar, Ameet Kini, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Record (34): 5-11 (2005). Cited by 26Web SearchBibTeXDownload

2004

115

Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation. Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton. ICDE 2004, 42-53. Cited by 51Web SearchBibTeXDownload

114

On the Integration of Structure Indexes and Inverted Lists. Raghav Kaushik, Rajasekar Krishnamurthy, Jeffrey F. Naughton, Raghu Ramakrishnan. SIGMOD Conference 2004, 779-790. Cited by 125Web SearchBibTeXDownload

113

Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams. Ahmed Ayad, Jeffrey F. Naughton. SIGMOD Conference 2004, 419-430. Cited by 66Web SearchBibTeXDownload

112

Toward a Progress Indicator for Database Queries. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. SIGMOD Conference 2004, 791-802. Cited by 48Web SearchBibTeXDownload

111

Efficient XML-to-SQL Query Translation: Where to Add the Intelligence?. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. VLDB 2004, 144-155. Cited by 44Web SearchBibTeXDownload

110

Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. WebDB 2004, 49-54. Cited by 4Web SearchBibTeXDownload

2003

109

Building XML statistics for the hidden web. Ashraf Aboulnaga, Jeffrey F. Naughton. CIKM 2003, 358-365. Cited by 9Web SearchBibTeXDownload

108

The Lowell Database Research Self Assessment. Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik. CoRR (cs.DB/0310006) (2003). Web SearchBibTeXDownload

107

A Comparison of Three Methods for Join View Maintenance in Parallel RDBMS. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. ICDE 2003, 177-188. Cited by 10Web SearchBibTeXDownload

106

Evaluating Window Joins over Unbounded Streams. Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas. ICDE 2003, 341-352. Cited by 267Web SearchBibTeXDownload

105

On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton. ICDT 2003, 267-281. Cited by 17Web SearchBibTeXDownload

104

On Relational Support for XML Publishing: Beyond Sorting and Tagging. Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naughton. SIGMOD Conference 2003, 611-622. Cited by 27Web SearchBibTeXDownload

103

On Schema Matching with Opaque Column Names and Data Values. Jaewoo Kang, Jeffrey F. Naughton. SIGMOD Conference 2003, 205-216. Cited by 123Web SearchBibTeXDownload

102

Reminiscences an Influential Papers. Kenneth A. Ross, Minos N. Garofalakis, Jeffrey F. Naughton. SIGMOD Record (32): 62-63 (2003). Web SearchBibTeXDownload

101

Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. Stratis Viglas, Jeffrey F. Naughton, Josef Burger. VLDB 2003, 285-296. Cited by 147Web SearchBibTeXDownload

100

Locking Protocols for Materialized Aggregate Join Views. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael Watzke. VLDB 2003, 596-607. Cited by 9Web SearchBibTeXDownload

Mixed Mode XML Query Processing. Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis Viglas, Yuan Wang, Jeffrey F. Naughton, David J. DeWitt. VLDB 2003, 225-236. Cited by 85Web SearchBibTeXDownload

XML-SQL Query Translation Literature: The State of the Art and Open Problems. Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton. Xsym 2003, 1-18. Cited by 107Web SearchBibTeXDownload

2002

A Non-Blocking Parallel Spatial Join Algorithm. Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann. ICDE 2002, 697-705. Cited by 23Web SearchBibTeXDownload

Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries. Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton. ICDE 2002, 345-356. Cited by 84Web SearchBibTeXDownload

Covering indexes for branching path queries. Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth. SIGMOD Conference 2002, 133-144. Cited by 228Web SearchBibTeXDownload

A scalable hash ripple join algorithm. Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey F. Naughton. SIGMOD Conference 2002, 252-262. Cited by 23Web SearchBibTeXDownload

Middle-tier database caching for e-business. Qiong Luo, Sailesh Krishnamurthy, C. Mohan, Hamid Pirahesh, Honguk Woo, Bruce G. Lindsay, Jeffrey F. Naughton. SIGMOD Conference 2002, 600-611. Cited by 127Web SearchBibTeXDownload

Rate-based query optimization for streaming information sources. Stratis Viglas, Jeffrey F. Naughton. SIGMOD Conference 2002, 37-48. Cited by 215Web SearchBibTeXDownload

Updates for Structure Indexes. Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Pradeep Shenoy. VLDB 2002, 239-250. Cited by 40Web SearchBibTeXDownload

2001

The Niagara Internet Query System. Jeffrey F. Naughton, David J. DeWitt, David Maier, Ashraf Aboulnaga, Jianjun Chen, Leonidas Galanis, Jaewoo Kang, Rajasekar Krishnamurthy, Qiong Luo, Naveen Prakash, Ravishankar Ramamurthy, Jayavel Shanmugasundaram, Feng Tian, Kristin Tufte, Stratis Viglas, Yuan Wang, Chun Zhang, Bruce Jackson, Anurag Kumar Gupta, Rushan Chen. IEEE Data Eng. Bull. (24): 27-33 (2001). Cited by 165Web SearchBibTeXDownload

On the Complexity of Join Predicates. Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton. PODS 2001. Cited by 13Web SearchBibTeXDownload

On Supporting Containment Queries in Relational Database Management Systems. Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, Qiong Luo, Guy M. Lohman. SIGMOD Conference 2001, 425-436. Cited by 655Web SearchBibTeXDownload

A General Techniques for Querying XML Documents using a Relational Database System. Jayavel Shanmugasundaram, Eugene J. Shekita, Jerry Kiernan, Rajasekar Krishnamurthy, Stratis Viglas, Jeffrey F. Naughton, Igor Tatarinov. SIGMOD Record (30): 20-26 (2001). Cited by 117Web SearchBibTeXDownload

Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. Ashraf Aboulnaga, Alaa R. Alameldeen, Jeffrey F. Naughton. VLDB 2001, 591-600. Cited by 173Web SearchBibTeXDownload

Form-Based Proxy Caching for Database-Backed Web Sites. Qiong Luo, Jeffrey F. Naughton. VLDB 2001, 191-200. Cited by 100Web SearchBibTeXDownload

Generating Synthetic Complex-Structured XML Data. Ashraf Aboulnaga, Jeffrey F. Naughton, Chun Zhang. WebDB 2001, 79-84. Cited by 44Web SearchBibTeX

2000

Materialized View Selection for Multi-Cube Data Models. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton. EDBT 2000, 269-284. Cited by 23Web SearchBibTeXDownload

Aggregate Aware Caching for Multi-Dimensional Queries. Prasad Deshpande, Jeffrey F. Naughton. EDBT 2000, 167-182. Cited by 22Web SearchBibTeXDownload

Accurate Estimation of the Cost of Spatial Selections. Ashraf Aboulnaga, Jeffrey F. Naughton. ICDE 2000, 123-134. Cited by 47Web SearchBibTeXDownload

SIGMOD'2000 Program Chair's Message. Jeffrey F. Naughton. SIGMOD Record (29): 10-11 (2000). Web SearchBibTeXDownload

Set Containment Joins: The Good, The Bad and The Ugly. Karthikeyan Ramasamy, Jignesh M. Patel, Jeffrey F. Naughton, Raghav Kaushik. VLDB 2000, 351-362. Cited by 40Web SearchBibTeXDownload

Architecting a Network Query Engine for Producing Partial Results. Jayavel Shanmugasundaram, Kristin Tufte, David J. DeWitt, Jeffrey F. Naughton, David Maier. WebDB (Informal Proceedings) 2000, 17-22. Cited by 46Web SearchBibTeXDownload

Active Query Caching for Database Web Servers. Qiong Luo, Jeffrey F. Naughton, Rajasekar Krishnamurthy, Pei Cao, Yunrui Li. WebDB (Informal Proceedings) 2000, 29-34. Cited by 67Web SearchBibTeXDownload

1999

Relational Databases for Querying XML Documents: Limitations and Opportunities. Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhang, Gang He, David J. DeWitt, Jeffrey F. Naughton. VLDB 1999, 302-314. Cited by 1077Web SearchBibTeXDownload

1998

The Asilomar Report on Database Research. Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman. CoRR (cs.DB/9811013): 74-80 (1998). Cited by 236Web SearchBibTeXDownload

Guest Editors' Introduction. Carolyn McGregor, Anthony Maedel, Laurence Tianruo Yang, Sanjay Goel, Alexander Zelikovsky. Distributed and Parallel Databases (6): 5-6 (1998). Cited by 2Web SearchBibTeXDownload

Remote Load-Sensitive Caching for Multi-Server Database Systems. Shivakumar Venkataraman, Jeffrey F. Naughton, Miron Livny. ICDE 1998, 514-521. Cited by 12Web SearchBibTeXDownload

Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Databases Systems. Yihong Zhao, Karthikeyan Ramasamy, Kristin Tufte, Jeffrey F. Naughton. ICDE 1998, 241-249. Cited by 22Web SearchBibTeXDownload

Caching Multidimensional Queries Using Chunks. Prasad Deshpande, Karthikeyan Ramasamy, Amit Shukla, Jeffrey F. Naughton. SIGMOD Conference 1998, 259-270. Cited by 182Web SearchBibTeXDownload

Simultaneous Optimization and Evaluation of Multiple Dimensional Queries. Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton, Amit Shukla. SIGMOD Conference 1998, 271-282. Cited by 66Web SearchBibTeXDownload

Materialized View Selection for Multidimensional Datasets. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton. VLDB 1998, 488-499. Cited by 200Web SearchBibTeXDownload

1997

Memory Management for Scalable Web Data Servers. Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton. ICDE 1997, 510-519. Cited by 13Web SearchBibTeXDownload

Cubing Algorithms, Storage Estimation, and Storage and Processing Alternatives for OLAP. Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy, Amit Shukla, Kristin Tufte, Yihong Zhao. IEEE Data Eng. Bull. (20): 3-11 (1997). Web SearchBibTeXDownload

The BUCKY Object-Relational Benchmark (Experience Paper). Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes Gehrke, Dhaval Shah. SIGMOD Conference 1997, 135-146. Cited by 68Web SearchBibTeXDownload

Building a Scaleable Geo-Spatial DBMS: Technology, Implementation, and Evaluation. Jignesh M. Patel, Jie-Bing Yu, Navin Kabra, Kristin Tufte, Biswadeep Nag, Josef Burger, Nancy E. Hall, Karthikeyan Ramasamy, Roger Lueder, Curt J. Ellmann, Jim Kupsch, Shelly Guo, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Conference 1997, 336-347. Cited by 106Web SearchBibTeXDownload

An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton. SIGMOD Conference 1997, 159-170. Cited by 399Web SearchBibTeXDownload

1996

Selectivity and Cost Estimation for Joins Based on Random Sampling. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami. J. Comput. Syst. Sci. (52): 550-569 (1996). Cited by 58Web SearchBibTeXDownload

Query Execution Techniques for Caching Expensive Methods. Joseph M. Hellerstein, Jeffrey F. Naughton. SIGMOD Conference 1996, 423-434. Cited by 87Web SearchBibTeXDownload

Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies. Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy. VLDB 1996, 522-531. Cited by 205Web SearchBibTeXDownload

On the Computation of Multidimensional Aggregates. Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi. VLDB 1996, 506-521. Cited by 584Web SearchBibTeXDownload

Parallelising OODBMS Traversals: A Performance Evaluation. David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman. VLDB J. (5): 3-18 (1996). Web SearchBibTeXDownload

1995

Space Optimization in Deductive Databases. Divesh Srivastava, S. Sudarshan, Raghu Ramakrishnan, Jeffrey F. Naughton. ACM Trans. Database Syst. (20): 472-516 (1995). Cited by 3Web SearchBibTeXDownload

The Impact of Data Placement on Memory Management for Multi-Server OODBMS. Shivakumar Venkataraman, Miron Livny, Jeffrey F. Naughton. ICDE 1995, 355-364. Cited by 9Web SearchBibTeXDownload

Query Size Estimation by Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton. J. Comput. Syst. Sci. (51): 18-25 (1995). Cited by 125Web SearchBibTeXDownload

On the Expected Size of Recursive Datalog Queries. S. Seshadri, Jeffrey F. Naughton. J. Comput. Syst. Sci. (51): 137-148 (1995). Cited by 8Web SearchBibTeXDownload

Adaptive Parallel Aggregation Algorithms. Ambuj Shatdal, Jeffrey F. Naughton. SIGMOD Conference 1995, 104-114. Cited by 87Web SearchBibTeXDownload

Argument Reduction by Factoring. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. Theor. Comput. Sci. (146): 269-310 (1995). Cited by 86Web SearchBibTeXDownload

OODB Bulk Loading Revisited: The Partitioned-List Approach. Janet L. Wiener, Jeffrey F. Naughton. VLDB 1995, 30-41. Cited by 32Web SearchBibTeXDownload

Sampling-Based Estimation of the Number of Distinct Values of an Attribute. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Lynne Stokes. VLDB 1995, 311-322. Cited by 208Web SearchBibTeXDownload

Generalized Search Trees for Database Systems. Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer. VLDB 1995, 562-573. Cited by 395Web SearchBibTeXDownload

1994

Storage Reclamation and Reorganization in Client-Server Persistent Object Stores. Voon-Fee Yong, Jeffrey F. Naughton, Jie-Bing Yu. ICDE 1994, 120-131. Cited by 60Web SearchBibTeXDownload

Low-Latency, Concurrent Checkpointing for Parallel Programs. Kai Li, Jeffrey F. Naughton, James S. Plank. IEEE Trans. Parallel Distrib. Syst. (5): 874-879 (1994). Web SearchBibTeXDownload

How to Forget the Past Without Repeating It. Jeffrey F. Naughton, Raghu Ramakrishnan. J. ACM (41): 1151-1177 (1994). Cited by 12Web SearchBibTeXDownload

A Status Report on the oo7 OODBMS Benchmarking Effort. Michael J. Carey, David J. DeWitt, Chander Kant, Jeffrey F. Naughton. OOPSLA 1994, 414-426. Cited by 63Web SearchBibTeXDownload

ParSets for Parallelizing OODBMS Traversals: Implementation and Performance. David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman. PDIS 1994, 111-120. Cited by 13Web SearchBibTeXDownload

On the Relative Cost of Sampling for Join Selectivity Estimation. Peter J. Haas, Jeffrey F. Naughton, Arun N. Swami. PODS 1994, 14-24. Cited by 34Web SearchBibTeXDownload

Shoring Up Persistent Applications. Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling. SIGMOD Conference 1994, 383-394. Cited by 446Web SearchBibTeXDownload

Bulk Loading into an OODB: A Performance Study. Janet L. Wiener, Jeffrey F. Naughton. VLDB 1994, 120-131. Cited by 23Web SearchBibTeXDownload

Cache Conscious Algorithms for Relational Query Processing. Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton. VLDB 1994, 510-521. Cited by 151Web SearchBibTeXDownload

1993

Clocked Adversaries for Hashing. Richard J. Lipton, Jeffrey F. Naughton. Algorithmica (9): 239-252 (1993). Cited by 10Web SearchBibTeXDownload

The oo7 Benchmark: Current Status & Future Directions. Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton. HPTS 1993. Cited by 1Web SearchBibTeX

Nested Loops Revisited. David J. DeWitt, Jeffrey F. Naughton, Joseph Burger. PDIS 1993, 230-242. Cited by 21Web SearchBibTeXDownload

Fixed-Precision Estimation of Join Selectivity. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami. PODS 1993, 190-201. Cited by 34Web SearchBibTeXDownload

The oo7 Benchmark. Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton. SIGMOD Conference 1993, 12-21. Cited by 365Web SearchBibTeXDownload

Using Shared Virtual Memory for Parallel Join Processing. Ambuj Shatdal, Jeffrey F. Naughton. SIGMOD Conference 1993, 119-128. Cited by 38Web SearchBibTeXDownload

Efficient Sampling Strategies for Relational Database Operations. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri. Theor. Comput. Sci. (116): 195-226 (1993). Cited by 71Web SearchBibTeXDownload

1992

Sampling Issues in Parallel Database Systems. S. Seshadri, Jeffrey F. Naughton. EDBT 1992, 328-343. Cited by 29Web SearchBibTeXDownload

On the Performance of Object Clustering Techniques. Manolis M. Tsangaris, Jeffrey F. Naughton. SIGMOD Conference 1992, 144-153. Cited by 115Web SearchBibTeXDownload

Practical Skew Handling in Parallel Joins. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri. VLDB 1992, 27-40. Cited by 172Web SearchBibTeXDownload

1991

Bottom-Up Evaluation of Logic Programs. Jeffrey F. Naughton, Raghu Ramakrishnan. Computational Logic - Essays in Honor of Alan Robinson 1991, 640-700. Cited by 39Web SearchBibTeX

An efficient checkpointing method for multicomputers with wormhole routing. Kai Li, Jeffrey F. Naughton, James S. Plank. International Journal of Parallel Programming (20): 159-180 (1991). Web SearchBibTeXDownload

One-Sided Recursions. Jeffrey F. Naughton. J. Comput. Syst. Sci. (42): 199-236 (1991). Cited by 55Web SearchBibTeXDownload

A Counting Algorithm for a Cyclic Binary Query. Ramsey W. Haddad, Jeffrey F. Naughton. J. Comput. Syst. Sci. (43): 145-169 (1991). Cited by 8Web SearchBibTeXDownload

A Simple Characterization of Uniform Boundedness for a Class of Recursions. Jeffrey F. Naughton, Yehoshua Sagiv. J. Log. Program. (10): 233-252 (1991). Cited by 6Web SearchBibTeXDownload

Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider. PDIS 1991, 280-291. Cited by 134Web SearchBibTeXDownload

On the Expected Size of Recursive Datalog Queries. S. Seshadri, Jeffrey F. Naughton. PODS 1991, 268-279. Cited by 8Web SearchBibTeXDownload

Space Optimization in the Bottom-Up Evaluation of Logic Programs. S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan, Jeffrey F. Naughton. SIGMOD Conference 1991, 68-77. Cited by 7Web SearchBibTeXDownload

A Stochastic Approach for Clustering in Object Bases. Manolis M. Tsangaris, Jeffrey F. Naughton. SIGMOD Conference 1991, 12-21. Cited by 92Web SearchBibTeXDownload

Checkpointing Multicomputer Applications. Kai Li, Jeffrey F. Naughton, James S. Plank. SRDS 1991, 2-11. Cited by 84Web SearchBibTeX

An Evaluation of Non-Equijoin Algorithms. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider. VLDB 1991, 443-452. Cited by 138Web SearchBibTeXDownload

1990

On Estimating the Size of Projections. Jeffrey F. Naughton, S. Seshadri. ICDT 1990, 499-513. Cited by 33Web SearchBibTeXDownload

Query Size Estimation by Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton. PODS 1990, 40-46. Cited by 125Web SearchBibTeXDownload

Real-Time, Concurrent Checkpoint for Parallel Programs. Kai Li, Jeffrey F. Naughton, James S. Plank. PPOPP 1990, 79-88. Cited by 103Web SearchBibTeXDownload

Practical Selectivity Estimation through Adaptive Sampling. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider. SIGMOD Conference 1990, 1-11. Cited by 233Web SearchBibTeXDownload

How to Forget the Past Without Repeating It. Jeffrey F. Naughton, Raghu Ramakrishnan. VLDB 1990, 278-289. Cited by 12Web SearchBibTeXDownload

1989

Minimizing function-free recursive inference rules. Jeffrey F. Naughton. J. ACM (36): 69-91 (1989). Cited by 22Web SearchBibTeXDownload

Data Independent Recursion in Deductive Databases. Jeffrey F. Naughton. J. Comput. Syst. Sci. (38): 259-289 (1989). Cited by 83Web SearchBibTeXDownload

Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. SIGMOD Conference 1989, 235-242. Cited by 90Web SearchBibTeXDownload

Argument Reduction by Factoring. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman. VLDB 1989, 173-182. Cited by 86Web SearchBibTeXDownload

Estimating the Size of Generalized Transitive Closures. Richard J. Lipton, Jeffrey F. Naughton. VLDB 1989, 165-171. Cited by 56Web SearchBibTeXDownload

1988

Multiprocessor Main Memory Transaction Processing. Kai Li, Jeffrey F. Naughton. DPDS 1988, 177-187. Cited by 31Web SearchBibTeX

Counting Methods for Cyclic Relations. Ramsey W. Haddad, Jeffrey F. Naughton. PODS 1988, 333-340. Cited by 36Web SearchBibTeXDownload

Compiling Separable Recursions. Jeffrey F. Naughton. SIGMOD Conference 1988, 312-319. Cited by 31Web SearchBibTeXDownload

1987

YAWN! (Yet Another Window on NAIL!). Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder. IEEE Data Eng. Bull. (10): 28-43 (1987). Cited by 32Web SearchBibTeXDownload

A Decidable Class of Bounded Recursions. Jeffrey F. Naughton, Yehoshua Sagiv. PODS 1987, 227-236. Cited by 60Web SearchBibTeXDownload

One-Sided Recursions. Jeffrey F. Naughton. PODS 1987, 340-348. Cited by 55Web SearchBibTeXDownload

1986

Data Independent Recursion in Deductive Databases. Jeffrey F. Naughton. PODS 1986, 267-279. Cited by 83Web SearchBibTeXDownload

Redundancy in Function-Free Recursive Rules. Jeffrey F. Naughton. SLP 1986, 236-245. Web SearchBibTeX

One-Sided Recursions. Jeffrey F. Naughton. XP7.52 Workshop on Database Theory 1986. Cited by 55Web SearchBibTeX

SIGMOD 2010 (Committee Members)^[1]
SIGMOD 2010 (SIGMOD New Initiatives Committee)^[2]
CIDR 2009 (PC)^[3]
SIGMOD 2009 (Committee Members)^[4]

Jeffrey F. Naughton

Related People

Related Topics

Services

Related Organizations

Tutorials

1.	^ The 2010 ACM SIGMOD/PODS Conference: Indianapolis, Indiana, USA - Organization: PODS Program Committee - Retrieved 2011-03-19 - details Original context from http://www.sigmod2010.org/org_pods_pc.shtml ... Univ. of Technology) Benny Kimelfeld (IBM Almaden Research Center) Tova Milo (Tel Aviv University) Jeffrey Naughton (Univ. of Wisconsin) Lucian Popa (IBM Almaden Research Center) Riccardo Rosati (University of Rome ...
2.	^ The 2010 ACM SIGMOD/PODS Conference: Indianapolis, Indiana, USA - Organization: Conference Officers - Retrieved 2011-03-19 - details Original context from http://www.sigmod2010.org/org_conference_officers.shtml ...o, Inc.) SIGMOD New Initiatives Committee Amr El Abbadi (University of California at Santa Barbara) Jeffrey F. Naughton (University of Wisconsin at Madison) Jennifer Widom (Stanford University) SIGMOD Demonstrations Loc...
3.	^ CIDR2009 Organization - Retrieved 2011-03-19 - details Original context from http://www.cidrdb.org/cidr2009/organization.html ...Zurich Paul Larson, Microsoft Boon Thau Loo, U. Pennsylvania Sam Madden, MIT Ioana Manolescu, INRIA Jeff Naughton , Wisconsin Chris Olston, Yahoo! Jignesh Patel, Wisconsin Hamid Pirahesh, IBM Raghu Ramakrishnan, Ya...
4.	^ The ACM SIGMOD/PODS Conference: Providence, Rhode Island, USA, 2009 - Organization: SIGMOD Program Committee - Retrieved 2009-11-21 - details Original context from http://www.sigmod09.org/org_sigmod_pc.shtml ...ey Melnik (Google) Gerome Miklau (University of Massachusetts) Renee Miller (University of Toronto) Jeff Naughton (University of Wisconsin) Kjetil Norvag (NTNU) Beng Chin Ooi (NUS) Chris Olston (Yahoo) Fatma Ozcan...
5.	^ The 2010 ACM SIGMOD/PODS Conference: Indianapolis, Indiana, USA - Conference Program: PODS Sessions - Retrieved 2011-03-19 - details Original context from http://www.sigmod2010.org/program_pods.shtml ...ion 7: Tuesday 13:30-15:00 Tutorial 2 & Information Complexity & Missing Information Session Chair: Jeffrey Naughton (Univ. of Wisconsin) Tutorial 2: Information Complexity T.S. Jayram Regular Paper: Capturing Missin...
6.	^ CIKM 2005 - Retrieved 2010-07-17 - details Original context from http://www.tzi.de/CIKM2005/tutorial.html ...ry 1.0 and XPath 2.0 Full-Text. W3C Working Draft. http://www.w3.org/TR/xquery-full-text/ C. Zhang, J. Naughton , D. DeWitt, Q. Luo, G. Lohman. On Supporting Containment Queries in Relational Database Management ...