Nitin Gupta, Advisor Prof, Johannes Gehrke, Minor Advisor, Prof Robert Bloomfield, Advisor Prof, ...
Honors Database Management; Personalization and extensibility of web applications; Infrastructure for virtual worlds and online collaboration; Financial and quantitative
Exploiting Asynchronous IO using the Asynchronous Iterator Model (2009)
Suresh Iyengar, S. Sudarshan, Santosh Kumar, Raja Agrawal
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issued at once, allowing...
Concurrency Control in Distributed MRA Index Structures (2009)
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Since the data set is...
ABSTRACT Keyword Search on External Memory Data Graphs (2009)
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudarshan
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural “lowest common denominator ” representation which can combine relational, XML and...
Detection and Recovery Techniques for Database Corruption (2009)
Philip Bohannon, Rajeev Rastogi, S. Seshadri, Avi Silberschatz, S. Sudarshan
Abstract—Increasingly, for extensibility and performance, special purpose application code is being integrated with database system code. Such application code has direct access to database system...
applications. In Procs. of the ACM SIGMOD Conf. on Management of Data, 1994. To appear. (2008)
Ag R. Agrawal, Bls P. Bohannon, D. Lieuwen, S. Sudarshan, ...
about operating system features � and Shaul Dar for numerous suggestions that helped improve the presentation signi cantly.
Lymphocyte subpopulation in healthy and diseased gingival tissue (2008)
Amunulla, A, Venkatesan, R, Ramakrishnan, H, Arun, KV, Sudarshan, S, Talwar, A
Nilesh N. Dalvi, Sumit K Sanghai, Prasan Roy, S. Sudarshan
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plans that share common...
Abstract Recovering from Main-Memory Lapses (2008)
H. V. Jagadish, Avi Silberschatz, S. Sudarshan
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery re-lated overhead is particularly...
Scheduling and Caching in Multi-Query Optimization (2008)
A. A. Diwan, S. Sudarshan, D. Thomas
Database systems frequently have to execute a batch of related queries. Multi-query optimization exploits evaluation plans that share common results. Current approaches to multi-query optimization...
Fine Grained Authorization Through Predicated Grants (2008)
Surajit Chaudhuri, Tanmoy Dutta, S. Sudarshan
Authorization in SQL is currently at the level of tables or columns. Many applications need a finer level of control. We propose a model for fine-grained authorization based on adding predicates to...
"Fundamentals of Database Systems " (3rd edn.), Addison−Wesley, 2000. (2008)
Jeffrey Ullman, Jennifer Widom, R Elmasri, S B Navathe, A Silberschatz, H F Korth, ...
Abstract Efficient and Extensible Algorithms for Multi Query Optimization (2008)
Prasan Roy, S. Seshadri, S. Sudarshan
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across...
User Interaction in the BANKS System: A Demonstration (2008)
B. Aditya, Soumen Chakrabarti, Rushi Desai, Arvind Hulgeri, Hrishikesh Karambelkar, Rupesh Nasre Parag, ...
The BANKS system supports keyword search on databases storing structured/semi-structured data. Answers to keyword queries are ranked, and as in IR systems, the top answers may not be exactly what a...
Reducing Order Enforcement Cost in Complex Query Plans (2008)
Ravindra Guravannavar, S Sudarshan
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort orders by using the...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across...
Detection and Recovery Techniques for Database Corruption (2008)
Philip Bohannon, Rajeev Rastogi, S. Seshadri, Avi Silberschatz, S. Sudarshan
Abstract—Increasingly, for extensibility and performance, special purpose application code is being integrated with database system code. Such application code has direct access to database system...
Scheduling and Caching in Multi-Query Optimization (2008)
A. A. Diwan, S. Sudarshan, D. Thomas
Database systems frequently have to execute a batch of related queries. Multi-query optimization exploits evaluation plans that share common results. Current approaches to multi-query optimization...
Scheduling and Caching in Multi-Query Optimization (2008)
A. A. Diwan, S. Sudarshan, Dilys Thomas
Database systems frequently have to execute a batch of related queries. Multi-query optimization exploits evaluation plans that share common results. Current approaches to multi-query optimization...
ABSTRACT Pipelining in Multi-Query Optimization ∗ (2008)
Nilesh N. Dalvi, Sumit K Sanghai, Prasan Roy, S. Sudarshan
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plans that share common...
Optimizations of Bottom-Up Evaluation with Non-Ground Terms (2007)
Extended Abstract, S. Sudarshan, Raghu Ramakrishnan
Memoization, such as that performed by bottom-up evaluation, helps detect loops, avoid repeated computation when subgoals are generated repeatedly, and in conjunction with a fair search strategy,...
Jerry D. Baulier, Philip Bohannon, Amit Khivesara, Henry F. Korth, Rajeev Rastogi, Avi Silberschatz, ...
General-purpose commercial database systems, though widely used, fail to meet the performance requirements of applications requiring short, predictable response times, and extremely high throughput...
Query Result Caching in Data Warehouses and Data Marts (2007)
Prasan Roy, Jinesh Vora, Krithi Ramamritham, S. Seshadri, S. Sudarshan
In data warehouse and data mart systems, queries often take a long time to execute due to their complex nature. A single user may submit a sequence of related queries, and queries submitted by...
Pradeep Shenoy, Jayant R. Haritsa, S. Sudarshan, Gaurav Bhalotia, Mayank Bawa, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even...
Announcements and Notices (2007)
Kaushik Chakrabarti, Michael Ortega, Kriengkrai Porkaew, Sharad Mehrotra, Leejay Wu, Christos Faloutsos, ...
TCDE Election Notice and Position Statement.................................................... 50 TCDE Election Ballot.................................................................... back cover...
Raghu Ramakrishnan, William G. Roth, Praveen Seshadri, Divesh Srivastava, S. Sudarshan
CORAL [4, 5] is a deductive database system that supports a powerful declarative query language. The language supports general Horn clause logic programs, extended with SQL-style
STAR: A System for Tuple and Attribute Ranking of Query Answers (Demo) (2007)
Kapoor, Nishant, Das, Gautam, Hristidis, Vagelis, Sudarshan, S., Weikum, Gerhard
In recent years there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in structured repositories such as relational databases - e.g., searching...
Silberschatz, Abraham, Korth, Henry F., Sudarshan, S.
Traducción de: Database System Concepts
Reducing Order Enforcement Cost in Complex Query Plans (2006)
Guravannavar, Ravindra, Sudarshan, S, Diwan, Ajit A, Babu, Ch. Sobhan
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort orders by using the...
Fundamentos de bases de datos / Abraham Silberschatz, Henry F. Korth, S. Sudarshan (2006)
Silberschatz, Abraham., Korth, Henry F., Sudarshan, S.
Traducción de: Database system concepts.
Optimizing nested queries with parameter sort orders (2005)
Ravindra Guravannavar, Ramanujam H. S, S Sudarshan
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-nested plans,...
Optimizing Nested Queries with Parameter Sort Orders (2005)
Ravindra Guravannavar Ramanujam, Ramanujam H. S, S Sudarshan
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-nested plans,...
AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions (2003)
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query optimization (PQO)...
Ranitidine alone and in combination with domperidone in reflux-type dyspepsia. (2002)
Sawant, P, Sahani, S, Dongre, N, Kulkarni, S, Dewan, B, Sudarshan, S
Fundamentos de bases de datos / Abraham Silberschatz, Henry F. Korth, S. Sudarsahn (2002)
Silberschatz, Abraham, Korth, Henry F, Sudarshan, S
Traducción de: Database system concepts
Keyword searching and browsing in databases using BANKS (2002)
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even...
Keyword search in databases (2001)
Arvind Hulgeri, Gaurav Bhalotia, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan
Querying using keywords is easily the most widely used form of querying today. While keyword searching is widely used to search documents on the Web, querying of databases currently relies on complex...
Materialized View Selection and Maintenance Using Multi-Query Optimization (2001)
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, whereas the amount of...
Turbo-charging vertical mining of large databases (2000)
Shenoy, Pradeep, Haritsa, Jayant R, Sudarshan, S, Bhalotia, Gaurav, Bawa, Mayank, Shah, Devavart
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Don't Trash your Intermediate Results, Cache 'em (2000)
Roy, Prasan, Ramamritham, Krithi, Seshadri, S., Shenoy, Pradeep, Sudarshan, S.
In data warehouse and data mart systems, queries often take a long time to execute due to their complex nature. Query response times can be greatly improved by caching final/intermediate results of...
Materialized View Selection and Maintenance Using Multi-Query Optimization (2000)
Mistry, Hoshi, Roy, Prasan, Ramamritham, Krithi, Sudarshan, S.
Because the presence of views enhances query performance, materialized views are increasingly being supported by commercial database/data warehouse systems. Whenever the data warehouse is updated,...
Turbo-charging Vertical Mining of Large Databases (2000)
Pradeep Shenoy, Gaurav Bhalotia, Mayank Bawa, S. Sudarshan, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Turbo-charging Vertical Mining of Large Databases (2000)
Pradeep Shenoy, Gaurav Bhalotia, Mayank Bawa, S. Sudarshan, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Efficient and Extensible Algorithms for Multi Query Optimization (2000)
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across...
Efficient and Extensible Algorithms for Multi Query Optimization (2000)
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across...
Efficient and Extensible Algorithms for Multi Query Optimization (1999)
Roy, Prasan, Seshadri, S., Sudarshan, S., Bhobe, Siddhesh
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across...
Using Codewords to Protect Database Data from a Class of Software Errors (1999)
Philip Bohannon, Rajeev Rastogi, S. Seshadri, Avi Silberschatz, S. Sudarshan
Increasingly, for extensibility and performance, specialpurpose application code is being integrated with database system code. Such application code has direct access to database system buffers, and...
DataBlitz Storage Manager: Main Memory Database Performance for Critical Applications (1999)
J. Baulier, P. Bohannon, S. Gogate, C. Gupta, S. Haldar, S. Joshi, ...
General-purpose commercial disk-based database systems, though widely employed in practice, have failed to meet the performance requirements of applications requiring short, predictable response...
Interestingness and Pruning of Mined Patterns (1999)
Devavrat Shah Laks, Devavrat Shah, Krithi Ramamritham, S. Sudarshan
We study the following question: when can a mined pattern, which may be an association, a correlation, ratio rule, or any other, be regarded as interesting? Previous approaches to answering this...
Interestingness and Pruning of Mined Patterns (1999)
Devavrat Shah Laks, Devavrat Shah, Krithi Ramamritham, S. Sudarshan
We study the following question: when can a mined pattern, which may be an association, a correlation, ratio rule, or any other, be regarded as interesting? Previous approaches to answering this...
Fundamentos de bases de datos (1998)
Korth, Henry F., Silberschatz, Abraham, Sudarshan, S.
Traducción de: Database Systems Concepts
Korth, Henry F., Silberschatz, Abraham, Sudarshan, S.
Traducción de: Database Systems Concepts
Fundamentos de bases de datos / Abraham Silberschatz, Henry F. Korth, S. Sudarshan (1998)
Silberschatz, Abraham, Korth, Henry F, Sudarshan, S
Incluye bibliografía e índice
Garbage collection in object oriented databases using transactional cyclic reference counting (1997)
Prasan Roy, S. Seshadri, Avi Silberschatz, S. Sudarshan, S. Ashwin
Garbage collection is important in object-oriented databases to free the programmer from explicitly deallocating memory. In this paper, we present a garbage collection algorithm, called Transactional...
Garbage collection in object oriented databases using transactional cyclic reference counting (1997)
S. Ashwin, Prasan Roy, S. Seshadri, Avi Silberschatz, S. Sudarshan
Garbage collection is important in objectoriented databases to free the programmer from explicitly deallocating memory. In this paper, we present a garbage collection algorithm, called Transactional...
Garbage collection in object oriented databases using transactional cyclic reference counting (1997)
S. Ashwin, Prasan Roy, S. Seshadri, Avi Silberschatz, S. Sudarshan
Garbage collection is important in objectoriented databases to free the programmer from explicitly deallocating memory. In this paper, we present a garbage collection algorithm, called Transactional...
The Architecture of the Dalí Main Memory Storage Manager (1997)
Philip L. Bohannon, Rajeev R. Rastogi, Avi Silberschatz, S. Sudarshan
ion Dal's architecture, illustrated in Figure 2, is organized in multiple layers of abstraction to support the toolkit approach discussed earlier. At the highest level, users can interact with...
Incremental Organization for Data Recording and Warehousing (1997)
H. V. Jagadish, S. Seshadri, S. Sudarshan, Rama Kanneganti
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored records is usually based...
Logical and Physical Versioning in Main Memory Databases (1997)
Rajeev Rastogi Seshadri, Rajeev Rastogi, S. Seshadri, Philip Bohannon, Dennis Leinbaugh, Avi Silberschatz, ...
We present a design for multi-version concurrency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to execute...
Incremental Organization for Data Recording and Warehousing (1997)
Jagadish Narayan Seshadri, H. V. Jagadish, S. Seshadri, S. Sudarshan, Rama Kanneganti
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored records is usually based...
Logical and Physical Versioning in Main Memory Databases (1997)
Rajeev Rastogi, S. Seshadri, Philip Bohannon, Dennis Leinbaugh, Avi Silberschatz, S. Sudarshan
We present a design for multi-version concurrency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to execute...
Well-Founded Ordered Search: Goal directed bottom-up evaluation of well-founded models (1997)
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in...
Logical and physical versioning in main memory databases (1997)
Rajeev Rastogi, S. Seshadri, Philip Bohannony, Dennis Leinbaughl, Avi Silberschatz, S. Sudarshan
We present a design for multi-version concurrency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to execute...
Clustering techniques for minimizing external path length (1996)
A. A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan
There are a variety of main-memory access structures, such as segment trees, and quad trees, whose properties, such as good worst-case behaviour, make them attractive for database applicdions....
Cost-based optimization for magic: algebra and implementation (1996)
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, Raghu Ramakrishnan, Divesh Srivastava, ...
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which differ greatly in...
Clustering Techniques for Minimizing External Path Length (1996)
A. A. Diwan, Diwan Sanjeeva Rane, S. Seshadri, S. Sudarshan
There are a variety of main-memory access structures, such as segment trees, and quad trees, whose properties, such as good worstcase behaviour, make them attractive for database applications....
Clustering Techniques for Minimizing External Path Length (1996)
A.A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan
There are a variety of main-memory access structures, such as segment trees, and quad trees, whose properties, such as good worst-case behaviour, make them attractive for database applications....
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time (1996)
Kenneth Ross, Divesh Srivastava, S. Sudarshan
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenance by materializing...
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time (1996)
Kenneth Ross, Divesh Srivastava, S. Sudarshan
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenance by materializing...
Avi Silberschatz, Henry F. Korth, S. Sudarshan
Underlying the structure of a database is a data model. A data model is a collection of conceptual tools for describing the real-world entities to be modeled in the database and the relationships...
Recoverable User-Level Mutual Exclusion (1995)
Philip Bohannon, Daniel Lieuwen, Avi Silberschatz, S. Sudarshan, Jacques Gava
Mutual exclusion primitives based on user-level atomic instructions (often called spin locks) have proven to be much more efficient than operating-system semaphores in situations where the contention...
Space Optimization in Deductive Databases (1995)
Divesh Srivastava, S. Sudarshan, Raghu Ramakrishnan, Jeffrey F. Naughton
In the bottom-up evaluation of logic programs and recursively defined views on databases, all generated facts are usually assumed to be stored until the end of the evaluation. Discarding facts during...
The CORAL Deductive System (1994)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, Praveen Seshadri
CORAL is a deductive system which supports a rich declarative language, and an interface to C++ which allows for a combination of declarative and imperative programming. The declarative query...
Foundations of Aggregation Constraints (1994)
Kenneth Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate functions. We...
The CORAL Deductive System (1994)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, Praveen Seshadri
CORAL is a deductive system which supports a rich declarative language, and an interface to C++ which allows for a combination of declarative and imperative programming. The declarative query...
Efficient Incremental Evaluation of Queries with Aggregation (1994)
Raghu Ramakrishnan, Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
We present a technique for efficiently evaluating queries on programs with monotonic aggregation, a class of programs defined by Ross and Sagiv. Our technique consists of the following components:...
The Valid Model Semantics for Logic Programs (1994)
Catriel Beeri, Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
We present the valid model semantics, a new approach to providing semantics for logic programs with negation, setterms and grouping. The valid model semantics is a threevalued semantics, and is...
Foundations of Aggregation Constraints (1994)
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
. We introduce a new constraint domain, aggregation constraints, which is useful in database query languages, and in constraint logic programming languages that incorporate aggregate functions. We...
Foundations of Aggregation Constraints (1994)
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate functions. We...
Efficient Incremental Evaluation of Queries with Aggregation (1994)
Raghu Ramakrishnan, Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
We present a technique for efficiently evaluating queries on programs with monotonic aggregation, a class of programs defined by Ross and Sagiv. Our technique consists of the following components:...
Dali: A high performance main memory storage manager (1994)
H. V. Jagadish, Daniel Lieuwen, Rajeev Rastogi, S. Sudarshan, Avi Silberschatz
Performance needs of many database appli-cations dictate that the entire database be stored in main memory. The Dali system is a main memory storage manager designed to provide the persistence,...
The CORAL Deductive System (1994)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, Praveen Seshadri
Abstract. CORAL is a deductive system that supports a rich declarative language, and an interface to C+ +, which allows for a combination of declarative and imperative programming. A CORAL...
Implementation of the CORAL deductive database system (1993)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, Praveen Seshadri
CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The...
Coral++: Adding object-orientation to a logic database language (1993)
Divesh Srivastava, Raghu Ramakrishnan, Praveen Seshadri, S. Sudarshan
Coral++ is a database programming language that integrates Coral [23] with the C++ type system. The data model allows arbitrary C++ objects in database facts, and the declarative query language...
Extending the Well-Founded and Valid Semantics for Aggregation (1993)
S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan
We present a very general technique for defining semantics for programs that use aggregation. We use the technique to extend the well-founded semantics and the valid semantics, both of which were...
Recovering from Main-Memory Lapses (1993)
H. V. Jagadish, Avi Silberschatz, S. Sudarshan
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery related overhead is particularly...
Design and Implementation of the SWORD Declarative Object-Oriented Database System (1993)
Inderpal Singh Mumick, Kenneth A. Ross, S. Sudarshan
SWORD is a declarative object-oriented database being built at AT&T Bell Laboratories. SWORD provides both procedural and declarative data manipulation languages. SWORD is integrated with the O++...
Extending the Well-Founded and Valid Semantics for Aggregation (1993)
S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan, Catriel Beeri
We present a very general technique for defining semantics for programs that use aggregation. We use the technique to extend the well-founded semantics and the valid semantics, both of which were...
Design and Implementation of the (1993)
Sword Declarative, Inderpal Singh Mumick, Kenneth A. Ross, S. Sudarshan
SWORD is a declarative object-oriented database being built at AT&T Bell Laboratories. SWORD provides both procedural and declarative data manipulation languages. SWORD is integrated with the O++...
Implementation of the CORAL Deductive Database System (1993)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, Praveen Seshadri
CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The...
Coral++: Adding Object-Orientation to a Logic Database Language (1993)
Divesh Srivastava, Raghu Ramakrishnan, Praveen Seshadri, S. Sudarshan
Coral++ is a database programming language that integrates Coral [23] with the C++ type system. The data model allows arbitrary C++ objects in database facts, and the declarative query language...
Efficient Bottom-up Evaluation of Logic Programs (1992)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Abstract. In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting...
CORAL---Control, Relations and Logic (1992)
Raghu Ramakrishnan Divesh, Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
CORAL is a modular declarative query language/programming language that supports general Horn clauses with complex terms, set-grouping, aggregation, negation, and relations with tuples that contain...
CORAL-Control, Relations and Logic (1992)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
CORAL is a modular declarative query language/programming language that supports general Horn clauses with complex terms, set-grouping, aggregation, negation, and relations with tuples that contain...
Controlling the Search in Bottom-Up Evaluation (1992)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Bottom-up evaluation of queries on deductive databases has many advantages over an evaluation scheme such as Prolog. It is sound and complete with respect to the declarative semantics of least...
Efficient Bottom-Up Evaluation Of Logic Programs (1992)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
. In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting techniques...
CORAL{control, relations and logic (1992)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
CORAL is a modular declarative query language/prog-ramming language that supports general Horn clauses with complex terms, set-grouping, aggregation, negation, and relations with tuples that contain...
Aggregation and Relevance in Deductive Databases (1991)
S. Sudarshan, Raghu Ramakrishnan
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and "largest k values. " Our approach is based on an...
Top-down vs. Bottom-up Revisited (1991)
Raghu Ramakrishnan, S. Sudarshan
Ullman ([Ull89a, Ull89b]) has shown that for the evaluation of safe Datalog programs, bottomup evaluation using Magic Sets optimization has time complexity less than or equal to a particular top-down...
Bls P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, John R. Ellis, ...
We would like to thank Boris Lubachevsky and Mark Dilman for pointing out an error in an earlier version of the cleanup algorithm, and Phil Gibbons for discussions about consistency models, and for...
Rule ordering in bottom-up fixpoint evaluation of logic programs (1990)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Abstract Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable--and in some...
Rule ordering in bottom-up fixpoint evaluation of logic programs (1990)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable--- and in some cases, e.g....
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (1990)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable --- and in some cases, e.g....
Space Optimization in the Bottom-Up Evaluation of Logic Programs (1990)
S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan, Jeffrey F. Naughton
In the bottom-up evaluation of a logic program, all generated facts are usually assumed to be stored until the end of the evaluation. Considerable gains can be achieved by instead discarding facts...
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (1990)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations ", until the fixpoint is reached. However, it is often desirable---and in some cases, e.g....
HIF and fumarate hydratase in renal cancer
Sudarshan, S, Linehan, W M, Neckers, L
Hereditary leiomyomatosis and renal cell cancer is a recently described hereditary cancer syndrome in which affected individuals are predisposed to the development of leiomyomas of the skin and...