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

Rolfe R. Schmidt

dblp:37/4391 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2010
—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-authorArtificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 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
1 paper
Query processing and optimization · 75% Indexing and storage engines · 25%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query execution
batch query processing
0.012002
How to Evaluate Multiple Range-Sum Queries Progressively · PODS 2002
Query processing and optimization
range query
0.012002
How to Evaluate Multiple Range-Sum Queries Progressively · PODS 2002
Query processing and optimization › range query
range-sum queries
0.012002
How to Evaluate Multiple Range-Sum Queries Progressively · PODS 2002
Indexing and storage engines › string indexing
wavelet-based indexing
0.012002
How to Evaluate Multiple Range-Sum Queries Progressively · PODS 2002

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

wavelet transform · 0.0error penalty functions · 0.0
YearPublicationVenuePosition
2010 Analyzing a Process of Collaborative Game Design Involving Online Tools
abstract
We explore modeling problem solving and design using state-space-search methodology by engaging in the design of an educational game. We also explore how online communication tools (OCTs) could be used to support collaborative design using two online tools: 1) CoSolve, a collaborative problem-solving environment we developed, and 2) INFACT, a discussion forum that we built for use in education. We used these tools to design GoAtom, a chemistry game. Using our game design experience as an example, we present a method for modeling design processes using state-space-search, and reflect on our use of OCTs.
Sandra B. Fan, Brian R. Johnson 0001, Yun-En Liu, Tyler Robison, Rolfe R. Schmidt, Steven L. Tanimoto
VL/HCC5
2003 Proteus: A System for Dynamically Composing and Intelligently Executing Web Services
Shahram Ghandeharizadeh, Craig A. Knoblock, Christos Papadopoulos, Cyrus Shahabi, Esam Alwagait, José Luis Ambite, Min Cai, Ching-Chien Chen, Parikshit Pol, Rolfe R. Schmidt, Saihong Song, Snehal Thakkar, Runfang Zhou
ICWS10
2002 A Comparison of Alternative Encoding Mechanisms for Web Services
Min Cai, Shahram Ghandeharizadeh, Rolfe R. Schmidt, Saihong Song
DEXA3
2002 ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries
Rolfe R. Schmidt, Cyrus Shahabi
EDBT1
2002 How to Evaluate Multiple Range-Sum Queries Progressively
abstract
Users of decision support system typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique that exploits T/O sharing across a query batch to evaluate the set of queries progressively and efficiently. The challenge is that now controlling the structure of errors across query results becomes more critical than minimizing error per individual query. Consequently, we define a class of structural error penalty functions and show how they are controlled by our technique Experiments demonstrate that our technique is efficient as an exact algorithm, and the progressive estimates are accurate, even after less than one I/O per query.
Rolfe R. Schmidt, Cyrus Shahabi
PODS1