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

Daniel H. Fishman

dblp:59/5099 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2001
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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
3 papers
Data integration and cleaning · 73% Database system architecture and tuning · 14% Data models and query languages · 10%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
2 papers
Automated reasoning and model checking · 36% Algorithms and data structures · 32% Logic in computer science · 32%

Topics — the 7 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages
object-oriented database
0.011987
Iris: An Object-Oriented Database Management System · ACM Trans. Inf. Syst. 1987
Database system architecture and tuning
database machine
0.011984
Overview of the Jasmin Database Machine · SIGMOD Conference 1984
Database system architecture and tuning › database machine
multiprocessor database machines
0.011984
Overview of the Jasmin Database Machine · SIGMOD Conference 1984
Automated reasoning and model checking
theorem proving
0.011976
A Problem-Oriented Search Procedure for Theorem Proving · IEEE Trans. Computers 1976
Algorithms and data structures › search algorithms › state-space search
parallel search
0.011975
Pi-Representation: A Clause Representation for Parallel Search · Artif. Intell. 1975
Natural language and speech › Question answering and dialogue systems › reasoning-based question answering
deductive question answering
0.021973
The Q* Algorithm - A Search Strategy for a Deductive Question-Answering System · IJCAI 1973
The Q* Algorithm - A Search Strategy for a Deductive Question-Answering System · Artif. Intell. 1973
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search
0.011973
The Q* Algorithm - A Search Strategy for a Deductive Question-Answering System · Artif. Intell. 1973

Methods — techniques the papers use, named apart from their topics

multiprocessor architecture · 0.0q* algorithm · 0.0lemma reuse · 0.0clause interaction selection · 0.0a* search · 0.0
YearPublicationVenuePosition
2001 Data Management Support of Web Applications
abstract
Automating the interactions between trusted business partners is a major goal of businesses today. This is often called "supply-chain integration". The intent is to make the businesses more responsive to customer needs and more efficient in their business or manufacturing processes. This paper describes an infrastructure that facilitates the collaboration of trusted business partners to achieve common business goals.
Daniel H. Fishman
ICDE1
1987 Iris: An Object-Oriented Database Management System
Daniel H. Fishman, David Beech, H. P. Cate, E. C. Chow, Tim Connors, J. W. Davis, Nigel Derrett, C. G. Hoch, William Kent, Peter Lyngbæk, Brom Mahbod, Marie-Anne Neimat, Thomas A. Ryan Jr., Ming-Chien Shan
ACM Trans. Inf. Syst.1
1984 Overview of the Jasmin Database Machine
abstract
The Jasmin database machine is being implemented as part of a research project in distributed processing and database management A primary goal of the work is to demonstrate the feasibility of a practical multiprocessor database machine suitable for large database, high transaction-rate applications Key features of Jasmin are its configurable performance, its use of off-the-shelf parts, and its ability to handle distributed databases A uniprocessor prototype of Jasmin has already been completed and the multiprocessor version is planned for later this year In this paper we describe Jasmin's architecture and discuss the performance observed in the uniprocessor prototype
Daniel H. Fishman, Ming-Yee Lai, Kevin Wilkinson
SIGMOD Conference1
1976 A Problem-Oriented Search Procedure for Theorem Proving
abstract
In, this paper we argue that if search procedures are to use problem-specific information to direct a search, then they must have complete control over the deductive process. This includes the freedom to select any pair of clauses to interact as well as the freedom to select the literals upon which to attempt the interaction. We give examples to indicate the nature of inference rules which are incompatible with such search procedures. We then present a framework for a search procedure to indicate where problem-specific information may be utilized. Finally, we augment the search procedure to prevent the generation of certain redundant inferences. The augmentation makes use of lemmas to avoid replicating deduction sequences in solving multiple instances of the same subproblem at distinct places in the search space.
Daniel H. Fishman
IEEE Trans. Computers1
1975 Pi-Representation: A Clause Representation for Parallel Search
Daniel H. Fishman, Jack Minker
Artif. Intell.1
1973 The Q* Algorithm - A Search Strategy for a Deductive Question-Answering System
Jack Minker, Daniel H. Fishman, James R. McSkimin
IJCAI2
1973 The Q* Algorithm - A Search Strategy for a Deductive Question-Answering System
Jack Minker, Daniel H. Fishman, James R. McSkimin
Artif. Intell.2