Stanford Warren Ascherman Professor of Engineering, Emeritus Computer Science
|
|
|
- Alice Pitts
- 6 years ago
- Views:
Transcription
1 Stanford Warren Ascherman Professor of Engineering, Emeritus Computer Science Bio ACADEMIC APPOINTMENTS Emeritus Faculty, Acad Council, Computer Science Teaching COURSES Mining Massive Data Sets: CS 246 (Win) Project in Mining Massive Data Sets: CS 341 (Spr) Mining Massive Data Sets: CS 246 (Win) Project in Mining Massive Data Sets: CS 341 (Spr) Project in Mining Massive Data Sets: CS 341 (Spr) STANFORD ADVISEES Master's Program Advisor Udai Baisiwala, Shiyu Huang, Vinson Luo, Antariksh Mahajan, Sumit Minocha, Indira Puri, Bradley Ross, John Solitario, Marcos Torres, Angel Antonio de Leon Publications PUBLICATIONS Experiments as Research Validation: Have We Gone Too Far? COMMUNICATIONS OF THE ACM Ullman, J. D. 2015; 58 (9): Brief Announcement: Assignment of Different-Sized Inputs in MapReduce 28th International Symposium on Distributed Computing Afrati, F., Dolev, S., Korach, E., Sharma, S., Ullman, J. D. SPRINGER-VERLAG BERLIN.2014: Fuzzy Joins Using MapReduce 28th IEEE International Conference on Data Engineering (ICDE) Afrati, F. N., Das Sarma, A., Menestrina, D., Parameswaran, A., Ullman, J. D. IEEE.2012: Page 1 of 6
2 Optimizing Multiway Joins in a Map-Reduce Environment IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING Afrati, F. N., Ullman, J. D. 2011; 23 (9): Cluster Computing, Recursion and Datalog 1st International Workshop on Datalog Reloaded (Datalog) Afrati, F. N., Borkar, V., Carey, M., Polyzotis, N., Ullman, J. D. SPRINGER.2011: Using views to generate efficient evaluation plans for queries JOURNAL OF COMPUTER AND SYSTEM SCIENCES Afrati, F. N., Li, C., Ullman, J. D. 2007; 73 (5): The Lowell database - Research self assessment COMMUNICATIONS OF THE ACM Abiteboul, S., Agrawal, R., Bernstein, P., Carey, M., Ceri, S., Croft, B., DeWitt, D., Franklin, M., Molina, H. G., Gawlick, D., Gray, J., Haas, L., Halevy, et al 2005; 48 (5): Querying websites using compact skeletons 20th Symposium on Principles of Database Systems Rajaraman, A., Ullman, J. D. ACADEMIC PRESS INC ELSEVIER SCIENCE.2003: A survey of new directions in database systems 8th International Conference on Database Systems for Advanced Applications Ullman, J. D. IEEE COMPUTER SOC.2003: 3 3 Generating efficient plans for queries using views ACM SIGMOD International Conference on Management of Data Afrati, F. N., Li, C., ASSOC COMPUTING MACHINERY.2001: Minimizing view sets without losing query-answering power 8th International Conference on Database Theory (ICDT 2001) Li, C., Bawa, M., SPRINGER-VERLAG BERLIN.2001: Finding interesting associations without support pruning 16th International Conference on Data Engineering (ICDE 2000) Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R.,, Yang, C. IEEE COMPUTER SOC.2001: Scalable techniques for mining causal structures DATA MINING AND KNOWLEDGE DISCOVERY Silverstein, C., Brin, S., Motwani, R., Ullman, J. 2000; 4 (2-3): Information integration using logical views 6th International Conference on Database Theory (ICDT 97) ELSEVIER SCIENCE BV.2000: Answering queries using limited external query processors 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Levy, A. Y., Rajaraman, A., Ullman, J. D. ACADEMIC PRESS INC ELSEVIER SCIENCE.1999: Computing capabilities of mediators 1999 ACM SIGMOD International Conference on Management of Data Yerneni, R., Li, C., Garcia-Molina, H., Ullman, J. ASSOC COMPUTING MACHINERY.1999: Optimizing large join queries in mediation systems 7th International Conference on Database Theory (ICDT 99) Yerneni, R., Li, C., Ullman, J., Garcia-Molina, H. SPRINGER-VERLAG BERLIN.1999: Information integration using logical views 6th International Conference on Database Theory SPRINGER-VERLAG BERLIN.1997: Page 2 of 6
3 Index selection for OLAP 13th International Conference on Data Engineering Gupta, H., Harinarayan, V., Rajaraman, A., IEEE COMPUTER SOC.1997: Representative objects: Concise representations of semistructured, hierarchical data 13th International Conference on Data Engineering Nestorov, S., Ullman, J., Wiener, J., Chawathe, S. IEEE COMPUTER SOC.1997: Medmaker: A mediation system based on declarative specifications 12th IEEE International Conference on Data Engineering Papakonstantinou, Y., GARCIAMOLINA, H., Ullman, J. I E E E, COMPUTER SOC PRESS.1996: The database approach to knowledge representation 13th National Conference on Artificial Intelligence (AAAI 96) / 8th Conference on Innovative Applications of Artificial Intelligence (IAAI 96) ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE.1996: ARGUMENT REDUCTION BY FACTORING THEORETICAL COMPUTER SCIENCE Naughton, J. F., Ramakrishnan, R., Sagiv, Y., 1995; 146 (1-2): A SURVEY OF DEDUCTIVE DATABASE-SYSTEMS JOURNAL OF LOGIC PROGRAMMING Ramakrishnan, R., 1995; 23 (2): THE ROLE OF THEORY TODAY ACM COMPUTING SURVEYS 1995; 27 (1): A VERSION NUMBERING SCHEME WITH A USEFUL LEXICOGRAPHICAL ORDER 11th International Conference on Data Engineering Keller, A. M., I E E E, COMPUTER SOC PRESS.1995: LOGICAL QUERY OPTIMIZATION BY PROOF-TREE TRANSFORMATION JOURNAL OF COMPUTER AND SYSTEM SCIENCES Ramakrishnan, R., Sagiv, Y.,, Vardi, M. Y. 1993; 47 (1): NEW FRONTIERS IN DATABASE SYSTEM RESEARCH LECTURE NOTES IN COMPUTER SCIENCE 1992; 653: HIGH-PROBABILITY PARALLEL TRANSITIVE-CLOSURE ALGORITHMS SIAM JOURNAL ON COMPUTING, Yannakakis, M. 1991; 20 (1): A COMPARISON BETWEEN DEDUCTIVE AND OBJECT-ORIENTED DATABASE-SYSTEMS 2ND INTERNATIONAL CONF ON DEDUCTIVE AND OBJECT-ORIENTED DATABASES ( DOOD 91 ) SPRINGER VERLAG.1991: HIGH-PROBABILITY PARALLEL TRANSITIVE CLOSURE ALGORITHMS 2ND ANNUAL SYMP OF THE ASSOC FOR COMPUTING MACHINERY : PARALLEL ALGORITHMS AND ARCHITECTURES ( SPAA 90 ) / AEGEAN WORKSHOP ON COMPUTING, Yannakakis, M. ASSOC COMPUTING MACHINERY.1990: THE INPUT OUTPUT COMPLEXITY OF TRANSITIVE CLOSURE 1990 INTERNATIONAL CONF ON MANAGEMENT DATA, Yannakakis, M. ASSOC COMPUTING MACHINERY.1990: AN OPTIMAL SYNCHRONIZER FOR THE HYPERCUBE SIAM JOURNAL ON COMPUTING Page 3 of 6
4 Peleg, D., 1989; 18 (4): Jeffrey Ullman ON THE CONVERGENCE OF QUERY EVALUATION JOURNAL OF COMPUTER AND SYSTEM SCIENCES Afrati, F., Papadimitriou, C. H., Papageorgiou, G., Roussou, A., Sagiv, Y., 1989; 38 (2): EFFICIENT EVALUATION OF RIGHT-LINEAR, LEFT-LINEAR, AND MULTILINEAR RULES INTERNATIONAL CONF ON THE MANAGEMENT OF DATA Naughton, J. F., Ramakrishnan, R., Sagiv, Y., ASSOC COMPUTING MACHINERY.1989: ARGUMENT REDUCTION BY FACTORING 15TH INTERNATIONAL CONF ON VERY LARGE DATA BASES Naughton, J. F., Ramakrishnan, R., Sagiv, Y., MORGAN KAUFMANN PUB INC.1989: EFFICIENT TESTS FOR TOP-DOWN TERMINATION OF LOGICAL RULES JOURNAL OF THE ACM, VANGELDER, A. 1988; 35 (2): PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS ALGORITHMICA, VANGELDER, A. 1988; 3 (1): 5-42 A COMMUNICATION-TIME TRADEOFF SIAM JOURNAL ON COMPUTING Papadimitriou, C. H., 1987; 16 (4): ALGORITHMS FOR THE COMPILATION OF REGULAR EXPRESSIONS INTO PLAS ALGORITHMICA Karlin, A. R., TRICKEY, H. W., 1987; 2 (3): DESIGN OVERVIEW OF THE NAIL - SYSTEM LECTURE NOTES IN COMPUTER SCIENCE Morris, K.,, VANGELDER, A. 1986; 225: IMPLEMENTATION OF LOGICAL QUERY LANGUAGES FOR DATABASES ACM TRANSACTIONS ON DATABASE SYSTEMS 1985; 10 (3): CONNECTIONS IN ACYCLIC HYPERGRAPHS THEORETICAL COMPUTER SCIENCE Maier, D., 1984; 32 (1-2): SYSTEM/U - A DATABASE SYSTEM BASED ON THE UNIVERSAL RELATION ASSUMPTION ACM TRANSACTIONS ON DATABASE SYSTEMS Korth, H. F., Kuper, G. M., Feigenbaum, J., VANGELDER, A., 1984; 9 (3): ON THE FOUNDATIONS OF THE UNIVERSAL RELATION MODEL ACM TRANSACTIONS ON DATABASE SYSTEMS Maier, D.,, Vardi, M. Y. 1984; 9 (2): FLUX, SORTING, AND SUPERCOMPUTER ORGANIZATION FOR AL APPLICATIONS JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1984; 1 (2): TOOLS FOR TEMPLATE DEPENDENCIES SIAM JOURNAL ON COMPUTING Fagin, R., Maier, D.,, Yannakakis, M. 1983; 12 (1): Page 4 of 6
5 MAXIMAL OBJECTS AND THE SEMANTICS OF UNIVERSAL RELATION DATABASES ACM TRANSACTIONS ON DATABASE SYSTEMS Maier, D., 1983; 8 (1): 1-14 THE THEORY OF FUNCTIONAL AND TEMPLATE DEPENDENCIES THEORETICAL COMPUTER SCIENCE Sadri, F., 1982; 17 (3): BOUNDS ON THE SIZE AND TRANSMISSION RATE OF COMMUNICATIONS PROTOCOLS COMPUTERS & MATHEMATICS WITH APPLICATIONS Aho, A. V., WYNER, A. D., Yannakakis, M., 1982; 8 (3): TEMPLATE DEPENDENCIES - A LARGE CLASS OF DEPENDENCIES IN RELATIONAL DATABASES AND ITS COMPLETE AXIOMATIZATION JOURNAL OF THE ACM Sadri, F., 1982; 29 (2): THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED-CIRCUITS JOURNAL OF THE ACM FLOYD, R. W., 1982; 29 (3): A SIMPLIFIED UNIVERSAL RELATION ASSUMPTION AND ITS PROPERTIES ACM TRANSACTIONS ON DATABASE SYSTEMS Fagin, R., Mendelzon, A. O., 1982; 7 (3): DEADLOCK-FREE PACKET SWITCHING-NETWORKS SIAM JOURNAL ON COMPUTING Toueg, S., 1981; 10 (3): EQUIVALENCE OF RELATIONAL DATABASE SCHEMES SIAM JOURNAL ON COMPUTING Beeri, C., Mendelzon, A. O., Sagiv, Y., 1981; 10 (2): INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS SIAM JOURNAL ON COMPUTING Aho, A. V., Sagiv, Y., SZYMANSKI, T. G., 1981; 10 (3): ADEQUACY OF DECOMPOSITIONS OF RELATIONAL DATABASES JOURNAL OF COMPUTER AND SYSTEM SCIENCES Maier, D., Mendelzon, A. O., Sadri, F., 1980; 21 (3): EQUIVALENCES AMONG RELATIONAL EXPRESSIONS SIAM JOURNAL ON COMPUTING Aho, A. V., Sagiv, Y., 1979; 8 (2): CODE GENERATION FOR EXPRESSIONS WITH COMMON SUB-EXPRESSIONS JOURNAL OF THE ACM Aho, A. V., Johnson, S. C., 1977; 24 (1): OPERATIONS ON SPARSE RELATIONS COMMUNICATIONS OF THE ACM Hunt, H. B., SZYMANSKI, T. G., 1977; 20 (3): NODE LISTINGS FOR REDUCIBLE FLOW GRAPHS JOURNAL OF COMPUTER AND SYSTEM SCIENCES Aho, A. V., 1976; 13 (3): BOUNDS ON COMPLEXITY OF LONGEST COMMON SUBSEQUENCE PROBLEM JOURNAL OF THE ACM Page 5 of 6
6 Aho, A. V., Hirschberg, D. S., 1976; 23 (1): 1-12 Jeffrey Ullman DETERMINISTIC PARSING OF AMBIGUOUS GRAMMARS COMMUNICATIONS OF THE ACM Aho, A. V., Johnson, S. C., 1975; 18 (8): COMPLEXITY OF LR(K) TESTING COMMUNICATIONS OF THE ACM Hunt, H. B., SZYMANSKI, T. G., 1975; 18 (12): DYNAMIC MEMORIES WITH RAPID RANDOM AND SEQUENTIAL ACCESS IEEE TRANSACTIONS ON COMPUTERS Aho, A. V., 1974; C 23 (3): LINEAR PRECEDENCE FUNCTIONS FOR WEAK PRECEDENCE GRAMMARS INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS Aho, A. V., 1972; 3 (2-3): TRANSLATIONS ON A CONTEXT FREE GRAMMAR INFORMATION AND CONTROL Aho, A. V., 1971; 19 (5): 439-? Page 6 of 6
Who won the Universal Relation wars? Alberto Mendelzon University of Toronto
Who won the Universal Relation wars? Alberto Mendelzon University of Toronto Who won the Universal Relation wars? 1 1-a Who won the Universal Relation wars? The Good Guys. The Good Guys 2 3 Outline The
I. Khalil Ibrahim, V. Dignum, W. Winiwarter, E. Weippl, Logic Based Approach to Semantic Query Transformation for Knowledge Management Applications,
I. Khalil Ibrahim, V. Dignum, W. Winiwarter, E. Weippl, Logic Based Approach to Semantic Query Transformation for Knowledge Management Applications, Proc. of the International Conference on Knowledge Management
Novel Materialized View Selection in a Multidimensional Database
Graphic Era University From the SelectedWorks of vijay singh Winter February 10, 2009 Novel Materialized View Selection in a Multidimensional Database vijay singh Available at: https://works.bepress.com/vijaysingh/5/
Encyclopedia of Database Systems, Editors-in-chief: Özsu, M. Tamer; Liu, Ling, Springer, MAINTENANCE OF RECURSIVE VIEWS. Suzanne W.
Encyclopedia of Database Systems, Editors-in-chief: Özsu, M. Tamer; Liu, Ling, Springer, 2009. MAINTENANCE OF RECURSIVE VIEWS Suzanne W. Dietrich Arizona State University http://www.public.asu.edu/~dietrich
(Big Data Integration) : :
(Big Data Integration) : : 3 # $%&'! ()* +$,- 2/30 ()* + # $%&' = 3 : $ 2 : 17 ;' $ # < 2 6 ' $%&',# +'= > 0 - '? @0 A 1 3/30 3?. - B 6 @* @(C : E6 - > ()* (C :(C E6 1' +'= - ''3-6 F :* 2G '> H-! +'-?
Lecture 22 Acyclic Joins and Worst Case Join Results Instructor: Sudeepa Roy
CompSci 516 ata Intensive Computing Systems Lecture 22 Acyclic Joins and Worst Case Join Results Instructor: Sudeepa Roy uke CS, Fall 2016 CompSci 516: ata Intensive Computing Systems Announcements Final
The Near Greedy Algorithm for Views Selection in Data Warehouses and Its Performance Guarantees
The Near Greedy Algorithm for Views Selection in Data Warehouses and Its Performance Guarantees Omar H. Karam Faculty of Informatics and Computer Science, The British University in Egypt and Faculty of
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems Chen Li Information and Computer Science University of California, Irvine, CA 92697 chenli@ics.uci.edu Abstract In data-integration
Storing and Maintaining Semistructured Data Efficiently in an Object-Relational Database
Storing and Maintaining Semistructured Data Efficiently in an Object-Relational Database Yuanying Mo National University of Singapore moyuanyi@comp.nus.edu.sg Tok Wang Ling National University of Singapore
Data integration supports seamless access to autonomous, heterogeneous information
Using Constraints to Describe Source Contents in Data Integration Systems Chen Li, University of California, Irvine Data integration supports seamless access to autonomous, heterogeneous information sources
Answering Queries with Useful Bindings
Answering Queries with Useful Bindings CHEN LI University of California at Irvine and EDWARD CHANG University of California, Santa Barbara In information-integration systems, sources may have diverse and
fied by a regular expression [4,7,9,11,23,16]. However, this kind of navigational queries is not completely satisfactory since in many cases we would
![fied by a regular expression [4,7,9,11,23,16]. However, this kind of navigational queries is not completely satisfactory since in many cases we would](/thumbs/71/66202011.jpg "fied by a regular expression [4,7,9,11,23,16]. However, this kind of navigational queries is not completely satisfactory since in many cases we would")
Electronic Notes in Theoretical Computer Science 50 No. 3 (2001) Proc. GT-VMT 2001 URL: http://www.elsevier.nl/locate/entcs/volume50.html 10 pages Graph Grammars for Querying Graph-like Data S. Flesca,
Distributed Database Management Systems M. Tamer Özsu and Patrick Valduriez
Distributed Database Management Systems 1998 M. Tamer Özsu and Patrick Valduriez Outline Introduction - Ch 1 Background - Ch 2, 3 Distributed DBMS Architecture - Ch 4 Distributed Database Design - Ch 5
Wrapper 2 Wrapper 3. Information Source 2
Integration of Semistructured Data Using Outer Joins Koichi Munakata Industrial Electronics & Systems Laboratory Mitsubishi Electric Corporation 8-1-1, Tsukaguchi Hon-machi, Amagasaki, Hyogo, 661, Japan
Distributed Database
Distributed Database PhD. Marco Antonio RAMOS CORCHADO mramos@univ-tlse1.fr marco.corchado@gmail.com VORTEX-UAEM, 2008 Visual Objects: from Reality To EXpression Research interest Research interests: Interests:
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics Rada Chirkova Department of Computer Science, North Carolina State University Raleigh, NC 27695-7535 chirkova@csc.ncsu.edu Foto Afrati
Applied Mathematics Letters. Graph triangulations and the compatibility of unrooted phylogenetic trees
Applied Mathematics Letters 24 (2011) 719 723 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Graph triangulations and the compatibility
}Optimization Formalisms for recursive queries. Module 11: Optimization of Recursive Queries. Module Outline Datalog
Module 11: Optimization of Recursive Queries 11.1 Formalisms for recursive queries Examples for problems requiring recursion: Module Outline 11.1 Formalisms for recursive queries 11.2 Computing recursive
Query Containment in the Presence of Limited Access Patterns. Abstract
Query Containment in the Presence of Limited Access Patterns Chen Li Computer Science Department Stanford University chenli@db.stanford.edu Edward Chang Electrical & Computer Engineering University of
}Optimization. Module 11: Optimization of Recursive Queries. Module Outline
Module 11: Optimization of Recursive Queries Module Outline 11.1 Formalisms for recursive queries 11.2 Computing recursive queries 11.3 Partial transitive closures User Query Transformation & Optimization
following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r
![following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r](/thumbs/80/82451722.jpg "following syntax: R ::= > n j P j $i=n : C j :R j R 1 u R 2 C ::= > 1 j A j :C j C 1 u C 2 j 9[$i]R j (» k [$i]r) where i and j denote components of r")
Answering Queries Using Views in Description Logics Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini Dipartimento di Informatica e Sistemistica, Universit a di Roma La Sapienza" Via Salaria 113,
Mediating and Metasearching on the Internet
Mediating and Metasearching on the Internet Luis Gravano Computer Science Department Columbia University www.cs.columbia.edu/ gravano Yannis Papakonstantinou Computer Science and Engineering Department
Mining Negative Rules using GRD
Mining Negative Rules using GRD D. R. Thiruvady and G. I. Webb School of Computer Science and Software Engineering, Monash University, Wellington Road, Clayton, Victoria 3800 Australia, Dhananjay Thiruvady@hotmail.com,
Quotient Cube: How to Summarize the Semantics of a Data Cube
Quotient Cube: How to Summarize the Semantics of a Data Cube Laks V.S. Lakshmanan (Univ. of British Columbia) * Jian Pei (State Univ. of New York at Buffalo) * Jiawei Han (Univ. of Illinois at Urbana-Champaign)
Query Containment for Data Integration Systems
Query Containment for Data Integration Systems Todd Millstein University of Washington Seattle, Washington todd@cs.washington.edu Alon Levy University of Washington Seattle, Washington alon@cs.washington.edu
Relational Database Theory at Princeton and Beyond
Relational Database Theory at Princeton and Beyond David Maier Dept. of Computer Science and Engineering OGI School of Science & Technology at Oregon Health & Science University In the Beginning Dennis
Analysis of Query Processing and Optimization
Analysis of Query Processing and Optimization Nimra Memon, Muhammad Saleem Vighio, Shah Zaman Nizamani, Niaz Ahmed Memon, Adeel Riaz Memon, Umair Ramzan Shaikh Abstract Modern database management systems
Integrating Information by Outerjoins. Dept. of Computer Science. Stanford University ABSTRACT
Integrating Information by Outerjoins and Full Disjunctions 1 Anand Rajaraman Jerey D. Ullman Dept. of Computer Science Stanford University ABSTRACT Our motivation is the piecing together tidbits of information
Introduction Data Integration Summary. Data Integration. COCS 6421 Advanced Database Systems. Przemyslaw Pawluk. CSE, York University.
COCS 6421 Advanced Database Systems CSE, York University March 20, 2008 Agenda 1 Problem description Problems 2 3 Open questions and future work Conclusion Bibliography Problem description Problems Why
A MODEL FOR ADVANCED QUERY CAPABILITY DESCRIPTION IN MEDIATOR SYSTEMS
A MODEL FOR ADVANCED QUERY CAPABILITY DESCRIPTION IN MEDIATOR SYSTEMS Alberto Pan, Paula Montoto and Anastasio Molano Denodo Technologies, Almirante Fco. Moreno 5 B, 28040 Madrid, Spain Email: apan@denodo.com,
Bichromatic Line Segment Intersection Counting in O(n log n) Time
Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan Bryan T. Wilkinson Abstract We give an algorithm for bichromatic line segment intersection counting that runs in O(n log
A Critical Review on Concept of Green Databases
Global Journal of Business Management and Information Technology. Volume 1, Number 2 (2011), pp. 113-118 Research India Publications http://www.ripublication.com A Critical Review on Concept of Green Databases
Join Algorithms. Qiu, Yuan and Zhang, Haoqian
Join Algorithms Qiu, Yuan and Zhang, Haoqian Contents 1. Join algorithms in the lecture a. Nested-Loop Join b. Sort-merge Join c. Hash Join 2. Preliminaries a. Join as Hypergraphs b. The AGM bound for
Instructor: Dr. Mehmet Aktaş. Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University
Instructor: Dr. Mehmet Aktaş Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, http://www.mmds.org
STUDY ON FREQUENT PATTEREN GROWTH ALGORITHM WITHOUT CANDIDATE KEY GENERATION IN DATABASES
STUDY ON FREQUENT PATTEREN GROWTH ALGORITHM WITHOUT CANDIDATE KEY GENERATION IN DATABASES Prof. Ambarish S. Durani 1 and Mrs. Rashmi B. Sune 2 1 Assistant Professor, Datta Meghe Institute of Engineering,
Mining High Order Decision Rules
Mining High Order Decision Rules Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 e-mail: yyao@cs.uregina.ca Abstract. We introduce the notion of high
Appropriate Item Partition for Improving the Mining Performance
Appropriate Item Partition for Improving the Mining Performance Tzung-Pei Hong 1,2, Jheng-Nan Huang 1, Kawuu W. Lin 3 and Wen-Yang Lin 1 1 Department of Computer Science and Information Engineering National
ANDREAS PIERIS JOURNAL PAPERS
ANDREAS PIERIS School of Informatics, University of Edinburgh Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK apieris@inf.ed.ac.uk PUBLICATIONS (authors in alphabetical order) JOURNAL
Distributed Database Management Systems
Distributed Database Management Systems 1998 M. Tamer zsu and Patrick Valduriez Outline n Introduction n Background n Distributed DBMS Architecture n Distributed Database Design n Semantic Data Control
ADVANCE COURSE IN DISTRIBUTED COMPUTING Spring 2012 (Academic year 2011/2012). Prof. Y. Afek (afek at tau.ac...).
ADVANCE COURSE IN DISTRIBUTED COMPUTING Spring 2012 (Academic year 2011/2012). Prof. Y. Afek (afek at tau.ac...). Course Home Page www.cs.tau.ac.il/ afek/dc12.html A graduate course exploring current topics
Top-k Keyword Search Over Graphs Based On Backward Search
Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer
Mining High Average-Utility Itemsets
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Mining High Itemsets Tzung-Pei Hong Dept of Computer Science and Information Engineering
Time-aware Authority Ranking
Klaus Berberich 1 Michalis Vazirgiannis 1,2 Gerhard Weikum 1 1 Max Planck Institute for Informatics {kberberi, mvazirgi, weikum}@mpi-inf.mpg.de 2 Athens University of Economics & Business {mvazirg}@aueb.gr
FOL Modeling of Integrity Constraints (Dependencies)
FOL Modeling of Integrity Constraints (Dependencies) Alin Deutsch Computer Science and Engineering, University of California San Diego deutsch@cs.ucsd.edu SYNONYMS relational integrity constraints; dependencies
Research Article Structural Learning about Directed Acyclic Graphs from Multiple Databases
Abstract and Applied Analysis Volume 2012, Article ID 579543, 9 pages doi:10.1155/2012/579543 Research Article Structural Learning about Directed Acyclic Graphs from Multiple Databases Qiang Zhao School
Inference in Hierarchical Multidimensional Space
Proc. International Conference on Data Technologies and Applications (DATA 2012), Rome, Italy, 25-27 July 2012, 70-76 Related papers: http://conceptoriented.org/ Inference in Hierarchical Multidimensional
Communication and Memory Optimal Parallel Data Cube Construction
Communication and Memory Optimal Parallel Data Cube Construction Ruoming Jin Ge Yang Karthik Vaidyanathan Gagan Agrawal Department of Computer and Information Sciences Ohio State University, Columbus OH
Automatic Database Clustering Using Data Mining
Automatic Database Clustering Using Data Mining Sylvain Guinepain and Le Gruenwald 1 School of Computer Science The University of Oklahoma Norman, OK 73019, USA {Sylvain.Guinepain, ggruenwald}@ou.edu Abstract
MIWeb: Mediator-based Integration of Web Sources
MIWeb: Mediator-based Integration of Web Sources Susanne Busse and Thomas Kabisch Technical University of Berlin Computation and Information Structures (CIS) sbusse,tkabisch@cs.tu-berlin.de Abstract MIWeb
Improving Resource Management And Solving Scheduling Problem In Dataware House Using OLAP AND OLTP Authors Seenu Kohar 1, Surender Singh 2
Improving Resource Management And Solving Scheduling Problem In Dataware House Using OLAP AND OLTP Authors Seenu Kohar 1, Surender Singh 2 1 M.tech Computer Engineering OITM Hissar, GJU Univesity Hissar
Formal Languages and Compilers Lecture I: Introduction to Compilers
Formal Languages and Compilers Lecture I: Introduction to Compilers Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/
Accuracy Avg Error % Per Document = 9.2%
Quixote: Building XML Repositories from Topic Specic Web Documents Christina Yip Chung and Michael Gertz Department of Computer Science, University of California, Davis, CA 95616, USA fchungyjgertzg@cs.ucdavis.edu
A Commit Scheduler for XML Databases
A Commit Scheduler for XML Databases Stijn Dekeyser and Jan Hidders University of Antwerp Abstract. The hierarchical and semistructured nature of XML data may cause complicated update-behavior. Updates
Chapter 1, Introduction
CSI 4352, Introduction to Data Mining Chapter 1, Introduction Young-Rae Cho Associate Professor Department of Computer Science Baylor University What is Data Mining? Definition Knowledge Discovery from
Parsing. Handle, viable prefix, items, closures, goto s LR(k): SLR(1), LR(1), LALR(1)
TD parsing - LL(1) Parsing First and Follow sets Parse table construction BU Parsing Handle, viable prefix, items, closures, goto s LR(k): SLR(1), LR(1), LALR(1) Problems with SLR Aho, Sethi, Ullman, Compilers
Labeling Schemes for Vertex Connectivity
Labeling Schemes for Vertex Connectivity AMOS KORMAN CNRS and Université Paris Diderot - Paris 7, France. This paper studies labeling schemes for the vertex connectivity function on general graphs. We
CS Systems Qualifying Exam 2014
CS Systems Qualifying Exam 2014 Important Dates April 27: Registration ends. Registration instructions are below. When you register, you must declare the three exams you plan to take. May 19: Exams. Candidates
GDClust: A Graph-Based Document Clustering Technique
GDClust: A Graph-Based Document Clustering Technique M. Shahriar Hossain, Rafal A. Angryk Department of Computer Science, Montana State University, Bozeman, MT 59715, USA E-mail: {mshossain, angryk}@cs.montana.edu
Applications of Geometric Spanner
Title: Name: Affil./Addr. 1: Affil./Addr. 2: Affil./Addr. 3: Keywords: SumOriWork: Applications of Geometric Spanner Networks Joachim Gudmundsson 1, Giri Narasimhan 2, Michiel Smid 3 School of Information
CS Systems Qualifying Exam 2015
CS Systems Qualifying Exam 2015 Important Dates May 3: Registration ends. Registration instructions are below. When you register, you must declare the three exams you plan to take. May 18: Exams. Candidates
A VIEW OF DIRECTIONS IN RELATIONAL DATABASE THEORY Jeffrey D. Ullman t Stanford University Stanford, Calif., USA ABSTRACT
A VIEW OF DIRECTIONS IN RELATIONAL DATABASE THEORY Jeffrey D. Ullman t Stanford University Stanford, Calif., USA ABSTRACT We shall briefly survey what the author believes are some of the most fruitful
These notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
Systems. Ramana Yerneni, Chen Li. fyerneni, chenli, ullman, Stanford University, USA
Optimizing Large Join Queries in Mediation Systems Ramana Yerneni, Chen Li Jerey Ullman, Hector Garcia-Molina fyerneni, chenli, ullman, hectorg@cs.stanford.edu, Stanford University, USA Abstract. In data
An Investigation on Multi-Token List Based Proximity Search in Multi- Dimensional Massive Database
An Investigation on Multi-Token List Based Proximity Search in Multi- Dimensional Massive Database Haiying Shen, Ze Li, Ting Li Department of Computer Science and Engineering University of Arkansas, Fayetteville,
Sketching Asynchronous Streams Over a Sliding Window
Sketching Asynchronous Streams Over a Sliding Window Srikanta Tirthapura (Iowa State University) Bojian Xu (Iowa State University) Costas Busch (Rensselaer Polytechnic Institute) 1/32 Data Stream Processing
Inferring Structure in Semistructured Data
Inferring Structure in Semistructured Data SVETLOZAR NESTOROV æ SERGE ABITEBOUL y RAJEEV MOTWANI z Department of Computer Science Stanford University Stanford, CA 94305-9040 fevtimov,abiteboug@db.stanford.edu,
Logical Aspects of Massively Parallel and Distributed Systems
Logical Aspects of Massively Parallel and Distributed Systems Frank Neven Hasselt University PODS Tutorial June 29, 2016 PODS June 29, 2016 1 / 62 Logical aspects of massively parallel and distributed
Updates through Views
1 of 6 15 giu 2010 00:16 Encyclopedia of Database Systems Springer Science+Business Media, LLC 2009 10.1007/978-0-387-39940-9_847 LING LIU and M. TAMER ÖZSU Updates through Views Yannis Velegrakis 1 (1)
CS570 Introduction to Data Mining
CS570 Introduction to Data Mining Frequent Pattern Mining and Association Analysis Cengiz Gunay Partial slide credits: Li Xiong, Jiawei Han and Micheline Kamber George Kollios 1 Mining Frequent Patterns,
Inferring Structure in Semistructured Data
Inferring Structure in Semistructured Data SVETLOZAR NESTOROV SERGE ABITEBOUL RAJEEV MOTWANI æ Department of Computer Science Stanford University Stanford, CA 94305-9040 fevtimov,abiteboug@db.stanford.edu,
A Framework for Ontology Integration
A Framework for Ontology Integration Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, 00198 Roma, Italy
Mining of Massive Datasets
Mining of Massive Datasets Krzysztof Dembczyński Intelligent Decision Support Systems Laboratory (IDSS) Poznań University of Technology, Poland Software Development Technologies Master studies, second
Scribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu
CS 267 Lecture 3 Shortest paths, graph diameter Scribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu Today we will talk about algorithms for finding shortest paths in a graph.
Compression of the Stream Array Data Structure
Compression of the Stream Array Data Structure Radim Bača and Martin Pawlas Department of Computer Science, Technical University of Ostrava Czech Republic {radim.baca,martin.pawlas}@vsb.cz Abstract. In
Hybrid Feature Selection for Modeling Intrusion Detection Systems
Hybrid Feature Selection for Modeling Intrusion Detection Systems Srilatha Chebrolu, Ajith Abraham and Johnson P Thomas Department of Computer Science, Oklahoma State University, USA ajith.abraham@ieee.org,
DMSA TECHNIQUE FOR FINDING SIGNIFICANT PATTERNS IN LARGE DATABASE
DMSA TECHNIQUE FOR FINDING SIGNIFICANT PATTERNS IN LARGE DATABASE Saravanan.Suba Assistant Professor of Computer Science Kamarajar Government Art & Science College Surandai, TN, India-627859 Email:saravanansuba@rediffmail.com
Path Query Reduction and Diffusion for Distributed Semi-structured Data Retrieval+
Path Query Reduction and Diffusion for Distributed Semi-structured Data Retrieval+ Jaehyung Lee, Yon Dohn Chung, Myoung Ho Kim Division of Computer Science, Department of EECS Korea Advanced Institute
Anju Singh Information Technology,Deptt. BUIT, Bhopal, India. Keywords- Data mining, Apriori algorithm, minimum support threshold, multiple scan.
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on Association
On the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
Welcome to MTH401A!! Theory of Computation
Welcome to MTH401A!! Theory of Computation Contact Information Instructor : Office : 327, Faculty Building Phone : 7880 or 0512-259-7880 Email : akasha@iitk.ac.in Web : www.home.iitk.ac.in/~akasha Office
Brian F. Cooper. Distributed systems, digital libraries, and database systems
Brian F. Cooper Home Office Internet 2240 Homestead Ct. #206 Stanford University cooperb@stanford.edu Los Altos, CA 94024 Gates 424 http://www.stanford.edu/~cooperb/app/ (408) 730-5543 Stanford, CA 94305
Datalog. Susan B. Davidson. CIS 700: Advanced Topics in Databases MW 1:30-3 Towne 309
Datalog Susan B. Davidson CIS 700: Advanced Topics in Databases MW 1:30-3 Towne 309 http://www.cis.upenn.edu/~susan/cis700/homepage.html 2017 A. Alawini, S. Davidson References Textbooks Ramakrishnan and
Dynamic Optimization of Generalized SQL Queries with Horizontal Aggregations Using K-Means Clustering
Dynamic Optimization of Generalized SQL Queries with Horizontal Aggregations Using K-Means Clustering Abstract Mrs. C. Poongodi 1, Ms. R. Kalaivani 2 1 PG Student, 2 Assistant Professor, Department of
Database Management Systems CS Spring 2017
Database Management Systems CS 542 --- Spring 2017 Instructor: Elke Rundensteiner Office: FL 135 Email: rundenst@cs.wpi.edu http://web.cs.wpi.edu/~cs542/s17 Course Information Who should attend? Interested
CCF: Fast and Scalable Connected Component Computation in MapReduce
CCF: Fast and Scalable Connected Component Computation in MapReduce Hakan Kardes, Siddharth Agrawal, Xin Wang, and Ang Sun Data Research inome Inc. Bellevue, WA USA {hkardes, sagrawal,xwang,asun}@inome.com
Symmetrically Exploiting XML
Symmetrically Exploiting XML Shuohao Zhang and Curtis Dyreson School of E.E. and Computer Science Washington State University Pullman, Washington, USA The 15 th International World Wide Web Conference
An Evolutionary Algorithm for Mining Association Rules Using Boolean Approach
An Evolutionary Algorithm for Mining Association Rules Using Boolean Approach ABSTRACT G.Ravi Kumar 1 Dr.G.A. Ramachandra 2 G.Sunitha 3 1. Research Scholar, Department of Computer Science &Technology,
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor Leslie Lamport 1 Digital Equipment Corporation February 14, 1993 Minor revisions January 18, 1996 and September 14, 1996
APPLICATION OF HADOOP MAPREDUCE TECHNIQUE TOVIRTUAL DATABASE SYSTEM DESIGN. Neha Tiwari Rahul Pandita Nisha Chhatwani Divyakalpa Patil Prof. N.B.
APPLICATION OF HADOOP MAPREDUCE TECHNIQUE TOVIRTUAL DATABASE SYSTEM DESIGN. Neha Tiwari Rahul Pandita Nisha Chhatwani Divyakalpa Patil Prof. N.B.Kadu PREC, Loni, India. ABSTRACT- Today in the world of
Distributing the Derivation and Maintenance of Subset Descriptor Rules
Distributing the Derivation and Maintenance of Subset Descriptor Rules Jerome Robinson, Barry G. T. Lowden, Mohammed Al Haddad Department of Computer Science, University of Essex Colchester, Essex, CO4
Association Rules Mining:References
Association Rules Mining:References Zhou Shuigeng March 26, 2006 AR Mining References 1 References: Frequent-pattern Mining Methods R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm
MODELING AND QUERYING RECURSIVE DATA STRUCTURES I: INTRODUCTION
MODELING AND QUERYING RECURSIVE DATA STRUCTURES I: INTRODUCTION J.H. ter Bekke and J.A. Bakker Delft University of Technology Faculty of Information Technology and Systems e-mail: {J.H.terBekke, J.A.Bakker}@its.tudelft.nl
LEVENT V. ORMAN. Cornell University S.C. Johnson Graduate School of Management Ithaca, NY Telephone: (607)
LEVENT V. ORMAN Cornell University S.C. Johnson Graduate School of Management Ithaca, NY 14853 Telephone: (607) 255-4728 email: orman@cornell.edu Education: 1975-1979 Northwestern University Graduate School
Specifying the Standard Guidelines to Normalize the EERD Up to Best Normal Form
Specifying the Standard Guidelines to Normalize the EERD Up to Best Normal Form Abstract: In the traditional approach Entity Relationship Diagram plays vital and important role in structured database design
Fixpoint Path Queries
Fixpoint Path Queries N. Bidoit and M. Ykhlef LaBRI (U.R.A. 1304 du CNRS) Université Bordeaux I 351, Cours de la Libération, F-33405 Talence email : {Nicole.Bidoit, Mourad.Ykhlef}@labri.u-bordeaux.fr Abstract
Horizontal Aggregations for Mining Relational Databases
Horizontal Aggregations for Mining Relational Databases Dontu.Jagannadh, T.Gayathri, M.V.S.S Nagendranadh. Department of CSE Sasi Institute of Technology And Engineering,Tadepalligudem, Andhrapradesh,
Effective Semantic Search over Huge RDF Data
Effective Semantic Search over Huge RDF Data 1 Dinesh A. Zende, 2 Chavan Ganesh Baban 1 Assistant Professor, 2 Post Graduate Student Vidya Pratisthan s Kamanayan Bajaj Institute of Engineering & Technology,
Joint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
ISSN: (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com
An Ameliorated Methodology to Eliminate Redundancy in Databases Using SQL
An Ameliorated Methodology to Eliminate Redundancy in Databases Using SQL Praveena M V 1, Dr. Ajeet A. Chikkamannur 2 1 Department of CSE, Dr Ambedkar Institute of Technology, VTU, Karnataka, India 2 Department