Versions, Configurations, and Constraints in CEDB 1 (2009)
H. Craig Howard, Arthur M. Keller, Ashish Gupta, Karthik Krishnamurthy, Kincho H. Law, Paul M. Teicholz, ...
The architecture-engineering-construction (AEC) industry is highly fragmented, both vertically (between project phases, e.g., planning, design, and construction) and horizontally (between specialists...
Viewpoint Advising Students for Success (2009)
No two doctoral students are the same, and the things an advisor needs to do for each vary accordingly. The author can look back over his career and see several approaches that work, and one approach...
Viewpoint Advising Students for Success (2009)
No two doctoral students are the same, and the things an advisor needs to do for each vary accordingly. The author can look back over his career and see several approaches that work, and one approach...
• Compilers: Principles, Techniques, (2008)
Charles N. Fischer, Charles N. Fischer, Mayank Maheshwari, Key Dates, V. Aho, Monica S. Lam, ...
Office Hours:
• Compilers: Principles, Techniques, (2008)
Charles N. Fischer, Mayank Maheshwari, Cs Fall, Charles N. Fischer, Key Dates, V. Aho, ...
Office Hours:
A Linear List Merging Algorithm (2008)
Hopcroft, John E., Ullman, Jeffrey D.
A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and...
A Linear List Merging Algorithm (2008)
Hopcroft, John E., Ullman, Jeffrey D.
A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and...
Operating R.S. Gaines Systems Editor Protection in Operating Systems (2008)
Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
A model of protection mechanisms in computing systems is presented and its appropriateness is argued. The "safety " problem for protection systems under this model is to determine...
Harold Abelson, Gerald J. Sussman, Harold Abelson, Gerald Jay, Sussman Structure, Interpretation Of Computer, ...
Perville. Using the new ACM code of ethics in decision making. Communications
H. Craig Howard, Arthur M. Keller, Ashish Gupta, Karthik Krishnamurthy, Kincho H. Law, Paul M. Teicholz, ...
The architecture-engineering-construction (AEC) industry is highly fragmented, both vertically (between project phases, e.g., planning, design, and construction) and horizontally (between specialists...
Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, ...
Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only rules of...
Minimizing View Sets without Losing (2007)
Query-answering Power, Chen Li, Mayank Bawa, Jeffrey D. Ullman
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, we often need to...
Systemy baz danych : pełny wykład (2006)
Garcia-Molina, Hector, Ullman, Jeffrey D. (1942- ), Widom, Jennifer
Systemy baz danych : pełny wykład (2006)
Garcia-Molina, Hector, Ullman, Jeffrey D. (1942- ), Widom, Jennifer
Systemy baz danych : pełny wykład (2006)
Garcia-Molina, Hector, Ullman, Jeffrey D. (1942- ), Widom, Jennifer
Research into the Design and Implementation of Knowledge Base Systems. (2005)
The general goal of the work has been to develop the techniques needed to process queries, expressed as logic programs, efficiently. A system called NAIL was developed, bu mid-1989, to test out our...
Complete References List Each chapter has their own list of references (2005)
Ravi Sethi, Jeffrey D. Ullman, Compilers Principles
however, it is useful to show the
The Lowell Database Research Self-Assessment (2005)
Abiteboul, Serge, Agrawal, Rakesh, Bernstein, Philip A., Carey, Michael J., Ceri, Stefano, Croft, W. Bruce, ...
Database needs are changing, driven by the Internet and increasing amounts of scientific and sensor data. In this article, the authors propose research into several important new directions for...
The Compilation of Regular Expressions into Integrated Circuits. (2002)
Floyd,Robert W., Ullman,Jeffrey D.
We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada algorithm to convert a regular expression of length n into a...
Parallel Complexity of Logical Query Programs, (2002)
Ullman, Jeffrey D., Van Gelder, Allen
This document considers the parallel time complexity of logic programs without function symbols, called logical query programs. The authors give a PRAM algorithm for computing the minimum model of a...
Minimizing view sets without losing query-answering power (2001)
Chen Li, Mayank Bawa, Jeffrey D. Ullman
The problem of answering queries using views has been studied extensively, due to its relevance in a wide variety of data-management applications. In these applications, we often need to select a...
Generating Efficient Plans for Queries Using Views (2001)
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
We study the problem of generating efficient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialized from base...
Generating Efficient Plans for Queries Using Views (2001)
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
We study the problem of generating efficient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialized from base...
MEDIATED QUERY PROCESSING OVER AUTONOMOUS DATA SOURCES (2001)
Jeffrey D. Ullman, Yannis Papakonstantinou
ii
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large number of columns,...
Minimizing View Sets without Losing Query-Answering Power (2000)
Chen Li, Mayank Bawa, Jeffrey D. Ullman
The problem of answering queries using views has been studied extensively, due to its relevance in a wide variety of data-management applications. In these applications, we often need to select a...
Finding Interesting Associations without Support Pruning (2000)
Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, ...
Association-rule mining has heretofore relied on the conditionof high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only rules of...
Finding interesting associations without support pruning (2000)
Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, ...
Abstract Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
Dynamic Miss-Counting (DMC) algorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large number of...
Finding Interesting Associations without Support Pruning (1999)
Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Jeffrey D. Ullman, ...
Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only rules of...
Maximal Objects and the Semantics of Universal Relation Databases. (1998)
Maier, David, Ullman, Jeffrey D.
The universal relation concept is intended to provide the database user with a simplified model in which he can compose queries without regard to the underlying structure of the relations in the...
Research into the Design and Implementation of Knowledge-Base System. (1998)
A working prototype of the NAIL system was implemented. This system extends SQL, providing a general purpose computing capability. The two elements of NAIL consist of GLUE, a logical rule formulation...
Design and Implementation of Parallel Algorithms. (1998)
Greg Plaxton 1989B won the best paper award at SPAA for his recent work on three related problems, each highly fundamental: (1) Load balancing: given a distribution of tasks to processors, move the...
Design and Implementation of Parallel Algorithms. (1998)
Contents: Coupled Execute/Control Processor Architecture; Time-stamping in Networks; Linearizable Counting; Processor Assignment; Derandomization of Algorithms; Bipartite Matching; Network Flow...
Design and Implementation of Logical Database Languages. (1998)
Studies were made of the prototype GLUE/NAIL system which is a deductive database system, techniques for optimizing constraint maintenance in a distributed environment, approaches to nonmonotonic...
Efficient Management of Active Databases (1998)
Ullman, Jeffrey D., Widom, Jennifer
We have made advances in the following areas: Data cubes: these recent data-warehouse products need a way to optimize the use of space by selecting some views to maintain permanently. We have...
Estructuras de datos y algoritmos (1998)
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D.
Contenido: Diseño y análisis de algoritmos; Tipos de datos abstractos fundamentales; Arboles; Operaciones básicas con conjuntos; Métodos avanzados de representación de conjuntos; Grafos...
[Compiladores: principios, técnicas y herramientas] (1998)
Aho, Alfred V., Sethi, Ravi, Ullman, Jeffrey D.
Traducción de: Compilers: Principles, Techniques, and Tools
Estructuras de datos y algoritmos (1998)
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D.
968-444-345-5
Compiladores : principios, técnicas y herramientas (1998)
Aho, Alfred V., Sethi, Ravi, Ullman, Jeffrey D.
968-444-333-1
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions...
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate func-tions over an attribute (or set of attributes) to find aggregate values above some spec-ified threshold. We call such queries ice-berg queries, because the...
Query Flocks: a Generalization of Association-Rule Mining (1998)
Dick Tsur, Hitachi Corp, Jeffrey D. Ullman, Chris Clifton, Mitre Corp
Association-rule mining has proved a very successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the...
Query Flocks: a Generalization of Association-Rule Mining (1998)
Dick Tsur, Hitachi Corp, Jeffrey D. Ullman, Chris Clifton, Mitre Corp
Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the...
Computing iceberg queries efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions (such as COUNT, SUM) over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg...
Query Flocks: A Generalization of Association-Rule Mining (1998)
Dick Tsur Hitachi, Dick Tsur, Hitachi Corp, Jeffrey D. Ullman, Chris Clifton, Mitre Corp
Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the...
Computing Iceberg Queries Efficiently (1998)
Min Fang, Narayanan Shivakumar, Hector Garcia-molina, Rajeev Motwani, Jeffrey D. Ullman
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg queries, because the...
Query Flocks: A Generalization of Association-Rule Mining (1998)
Dick Tsur, Hitachi Corp, Jeffrey D. Ullman, Chris Clifton, Mitre Corp
Association-rule mining has proved a very successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the...
The Tower of Hanoi: A Bibliography (1998)
Paul K. Stockmeyer, Jeffrey D. Ullman
This is a substantially enlarged edition of the Tower of Hanoi bibliography first posted in 1997. In this edition, an attempt has been made to include every relevant document published during the...
The Equivalence of Universal Relation Definitions. (1997)
Ullman, Jeffrey D., Vardi, Moshe Y., Maier, David
The universal relation model aims at achieving complete access path independence by relieving the user of the need for logical navigation among relations. It assumes that for every set of attributes...
Connections in Acyclic Hypergraphs, (1997)
Maier, David, Ullman, Jeffrey D.
We demonstrate a sense in which the equivalence between blocks (subgraphs without articulation points) and biconnected components (subgraphs in which there are two edge-disjoint paths between any air...
Information integration using logical views (1997)
Abstract. A number of ideas concerning information-integration tools can be thought of as constructing answers to queries using views that represent the capabilities of information sources. We review...
Dynamic itemset counting and implication rules for market basket data (1997)
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data...
Index Selection for OLAP (1997)
Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
On-line analytical processing (OLAP) is a recent and important application of database systems. Typically, OLAP data is presented as a multidimensional "data cube." OLAP queries are complex...
Index Selection for OLAP (1997)
Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
On-line analytical processing (OLAP) is a recent and important application of database systems. Typically, OLAP data is presented as a multidimensional "data cube." OLAP queries are complex...
Dynamic Itemset Counting and Implication Rules for Market Basket Data (1997)
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data...
Query Flocks: A Generalization of Association-Rule Mining (1997)
Dick Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Hitachi Corp, ...
Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the...
Index Selection for OLAP (1997)
Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
On-line analytical processing (OLAP) is a recent and important application of database systems. Typically, OLAP data is presented as a multidimensional "data cube." OLAP queries are complex...
Information Integration Using Logical Views (1997)
A number of ideas concerning information-integration tools can be thought of as constructing answers to queries using views that represent the capabilities of information sources. We review the...
Integrating information by outerjoins and full disjunctions (Extended Abstract) (1996)
Anand Rajaraman, Jeffrey D. Ullman
Our motivation is the piecing together of tidbits of information found on the "web" into a usable information structure. The problem is related to that of computing the natural outerjoin of...
Integrating Information by Outerjoins and Full Disjunctions (1996)
Extend Ed, Anand Rajaraman, Jeffrey D. Ullman
) Anand Rajaraman Jeffrey D. Ullman Department of Computer Science Stanford University --anand, ullman@cs.stanford.edu Abstract Our motivation is the piecing together of tidbits of information found...
Implementing Data Cubes Efficiently (1996)
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional...
Answering Queries Using Limited External Query Processors (1996)
Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman
When answering queries using external information sources, their contents can be described by views. To answer a query, we must rewrite it using the set of views presented by the sources. When the...
Answering Queries Using Limited External Query Processors (1996)
Extend Ed, Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman
) Alon Y. Levy AT&T Research levy@research.att.com Anand Rajaraman Stanford University anand@cs.stanford.edu Jeffrey D. Ullman Stanford University ullman@cs.stanford.edu Abstract When answering...
Integrating Information by Outerjoins and Full Disjunctions (1996)
Anand Rajaraman, Jeffrey D. Ullman
Our motivation is the piecing together tidbits of information found on the "web" into a usable information structure. The problem is related to that of computing the natural outerjoin of...
Answering Queries Using Limited External Query Processors (1996)
Extend Ed, Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman
) Alon Y. Levy AT&T Research levy@research.att.com Anand Rajaraman Stanford University anand@cs.stanford.edu Jeffrey D. Ullman Stanford University ullman@cs.stanford.edu Abstract When answering...
The Database Approach to Knowledge Representation (1996)
The database theory community, centered around the PODS (Principles of Database Systems) conference has had a long-term interest in logic as a way to represent "data,"...
Answering Queries Using Limited External Query Processors (Extended Abstract) (1996)
Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman
When answering queries using external information sources, their contents can be described by views. To answer a query, we must rewrite it using the set of views presented by the sources. When the...
Foundations of computer science : C edition (1995)
Aho, Alfred V., Ullman, Jeffrey D.
Incluye índice
Foundations of computer science : C edition / A.V. Aho, J.D. Ullman. (1995)
Aho, Alfred V., Ullman, Jeffrey D.
Incluye índice
A Version Numbering Scheme with a Useful Lexicographical Order (1995)
Arthur M. Keller, Jeffrey D. Ullman
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we can easily...
Answering Queries Using Templates with Binding Patterns (1994)
Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman
) Anand Rajaraman Yehoshua Sagiv Jeffrey D. Ullman Department of Computer Science Stanford University ABSTRACT When integrating heterogeneous information resources, it is often the case that the...
Validating Constraints with Partial Information: Research Overview (1994)
Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman
We are interested in the problem of validating the consistency of integrity constraints when data is modified. In particular, we consider how constraints can be checked with only "partial...
Constraint Checking with Partial Information (Extended Abstract) (1994)
Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom
) Ashish Gupta Yehoshua Sagivy Jeffrey D. Ullman Jennifer Widom Dept. of Computer Science Stanford Univ., Stanford CA 94305 email: --agupta,sagiv,ullman,widom@cs.stanford.edu contact phone: (415)...
Constraint Checking with Partial Information (Extended Abstract) (1994)
Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom
Constraints are a valuable tool for managing information across multiple databases, as well as for general purposes of assuring data integrity. However, efficient implementation of constraint...
A Survey of Research on Deductive Database Systems (1993)
Raghu Ramakrishnan, Jeffrey D. Ullman
The area of deductive databases has matured in recent years, and it now seems appropriate to reflect upon what has been achieved and what the future holds. In this paper, we provide an overview of...
A Comparison Between Deductive And Object-Oriented Database Systems (1991)
The author will not pretend to be unbiased in the matter of comparing the deductive and object-oriented approaches to new database systems; he believes that despite some important concepts...
Deductive Databases: Achievements and Future Directions (1990)
Jeffrey D. Ullman, Carlo Zaniolo
In the recent years, Deductive Databases have been the focus of intense research, which has brought dramatic advances in theory, systems and applications. A salient feature of deductive databases is...
Aho, Alfred V, Hopcroft, John E, Ullman, Jeffrey D
Traducción de: "Data structures and algoritms"
Updating logical databases (1986)
Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi
We suggest a new approach to database updates, in which a database is treated as a collection of theories. We investigate two issues: simultaneous multiple update operations and equivalence of...
Data Structures and Algorithms (1983)
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D.
Este libro presenta la estructura de datos y algoritmos que apoyan a muchos de los programas de computación.
Data Structures and Algorithms / A.V. Aho, J.E. Hopcroft, J.D. Ullman. (1983)
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D.
Este libro presenta la estructura de datos y algoritmos que apoyan a muchos de los programas de computación.
Projektowanie i analiza algorytmów komputerowych (1983)
Aho, Alfred V. (1941- ), Hopcroft, John E. (1939- ), Ullman, Jeffrey D. (1942- )
Principles of Database Systems (1982)
Se ofrece teoría y principios generales relacionados a sistemas de bases de datos. Describe sistemas de bases de datos actuales y lenguajes tales como ISBL, QUEL, QUERY (con ejemplos) y SEQUEL.
Principles of Database Systems / J.D. Ullman. (1982)
Se ofrece teoría y principios generales relacionados a sistemas de bases de datos. Describe sistemas de bases de datos actuales y lenguajes tales como ISBL, QUEL, QUERY (con ejemplos) y SEQUEL.
A simplified universal relation assumption and its properties (1982)
Ronald Fagin, Albert Mendelzon, Jeffrey D. Ullman
One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set...
Principles of database systems / Jeffrey D. Ullman (1980)
Incluye bibliografía e índice
[Compiladores: principios, técnicas y herramientas] (1979)
Aho, Alfred V., Ullman, Jeffrey D.
Libro de texto para un curso introductorio de diseño de compiladores. Se pone especial énfasis en la resolución de problemas universalmente encontrados en el diseño de compiladores, haciendo caso...
Hopcroft, John E, Ullman, Jeffrey D
Incluye bibliografía e índice
Economy of description by parsers, DPDA's, and PDA's (1977)
Geller, Matthew M., Szymanski, Thomas G., Ullman, Jeffrey D.
It is shown that there is a sequence of languages E1, E2,... such that every correct prefix parser (one which detects errors at the earliest possible moment, e.g., LR or LL parsers) for En has size...
Fundamental concepts of programming systems (1976)
Contiene: Programas Estructurados; Datos y su Representación; Una Computadora Sencilla; Introducción a Estructuras de Datos; Lenguajes Ensambladores y Ensambladores; Loaders y Editores de Link;...
Fundamental concepts of programming systems / J.D. Ullman. (1976)
Contiene: Programas Estructurados; Datos y su Representación; Una Computadora Sencilla; Introducción a Estructuras de Datos; Lenguajes Ensambladores y Ensambladores; Loaders y Editores de Link;...
Fundamental concepts of programming systems / Jeffrey D. Ullman (1976)
Incluye bibliografía e índice
The design and analysis of computer algorithms / A.V. Aho, J.E. Hopcroft, J.D. Ullman. (1974)
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D.
La intención de este libro es unir los resultados fundamentales en el área de algoritmos, para unificar principios y resaltar conceptos de diseño de algoritmos y así se haga más fácil la...
The design and analysis of computer algoritms / by A. V. Aho, J. E. Hopcroft and J. D. Ullman (1974)
The theory of parsing, translation and compiling / A.V. Aho, J.D. Ullman. (1972)
Aho, Alfred V., Ullman, Jeffrey D.
Contiene: Vol.1: Parsing; Vol.2: Compilación
Finding Interesting Associations without Support Pruning
Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, ...
Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only rules of...