Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julie Basu

dblp:44/4427 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Database system architecture and tuning · 57% Query processing and optimization · 28% Data integration and cleaning · 15%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
query result caching
0.011996
A Predicate-based Caching Scheme for Client-Server Database Architectures · VLDB J. 1996
Data integration and cleaning
web data management
0.012000
Building Scalable Internet Applications with Oracle8i Server · VLDB 2000
Database system architecture and tuning › database system implementation
client-server database
0.011996
A Predicate-based Caching Scheme for Client-Server Database Architectures · VLDB J. 1996
YearPublicationVenuePosition
2000 Building Scalable Internet Applications with Oracle8i Server
Julie Basu, José Alberto Fernández, Olga Peschansky
VLDB1
1997 Centralized versus Distributed Index Schemes in OODBMS - A Performance Analysis
Julie Basu, Arthur M. Keller, Meikel Pöss
ADBIS1
1996 A Predicate-based Caching Scheme for Client-Server Database Architectures
Arthur M. Keller, Julie Basu
VLDB J.2
1987 Ordered Ports - A Language Concept for High-Level Distributed Programming
abstract
A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.
Julie Basu, Lalit M. Patnaik, Asis K. Goswami
Comput. J.1
1986 Two Tools for Interprocess Communication in Distributed Data-Flow Systems
abstract
Existing data-flow languages are incapable of supporting large, manageable and reliable non-deterministic programs. Operating system implementations and real-time applications require high-level non-deterministic programming facilities. Hoare's Communicating Sequential Processes and Brinch Hansen's Distributed Processes are two widely acclaimed distributed programming languages for conventional distributed computing systems. The powerful constructs of interprocess communication and synchronisation supported by the above two languages have been incorporated in Communicating Data Flow Channels (CDFC), and Distributed Data Flow Channels (DDFC), two languages proposed in this paper for distributed processing in data-flow systems. Several new features have been incorporated in these languages to make their execution more efficient in a data-flow environment. The implementation of these two languages on an abstract data-flow machine is investigated in detail. Two simulators have been implemented for testing the effectiveness of our implementation schemes for these two data-flow languages. These simulators are written in Pascal and run on a DEC 1090 computing system. This work demonstrates that a data-flow computing system can accommodate, without taking resort to specialised hardware units, the non-deterministic and synchronisation constructs of conventional languages with the attendant benefits of parallel data-driven execution.
Lalit M. Patnaik, Julie Basu
Comput. J.2