EDBT 2026 Demo / reviewers in the wild / expert
Pauray S. M. Tsai
dblp:20/2811
· DBLP profile ↗
9ranked-venue papers
8as 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 · 6 · 5 first-authorArtificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 1 · 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
1 paper |
Query processing and optimization · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › query optimization
distributed query optimization |
0.0 | 1 | 2002 | Optimizing Queries with Foreign Functions in a Distributed Environment · IEEE Trans. Knowl. Data Eng. 2002 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0response time model · 0.0heuristic algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Mining top-k frequent closed itemsets over data streams using the sliding window model
Pauray S. M. Tsai |
Expert Syst. Appl. | 1 |
| 2009 | Mining frequent itemsets in data streams using the weighted sliding window model
Pauray S. M. Tsai |
Expert Syst. Appl. | 1 |
| 2004 | Mining interesting association rules from customer databases and transaction databases
Pauray S. M. Tsai |
Inf. Syst. | 1 |
| 2002 | Optimizing Queries with Foreign Functions in a Distributed EnvironmentabstractForeign functions have been considered in the advanced database systems to support complex applications. We consider optimizing queries with foreign functions in a distributed environment. In traditional distributed query processing, selection operations are locally processed before joins as much as possible so that the size of relations being transmitted and joined can be reduced. However, if selection predicates involve foreign functions, the cost of evaluating selections cannot be ignored. As a result, the execution order of selections and joins becomes significant, and the trade-off for reducing the costs of data transmission, join processing, and selection predicate evaluation needs to be carefully considered in query optimization. A response time model is developed for estimating the cost of distributed query processing involving foreign functions. We explore the property of the problem and find an optimal algorithm with polynomial complexity for a special case of it. However, finding the optimal execution plan for the general case is NP-hard. We propose an efficient heuristic algorithm for solving the problem and the simulation result shows its good quality. The research result can also be applied to the advanced database systems and the multidatabase systems where the conversion function defined for the need of schema integration can be considered a type of foreign functions. Pauray S. M. Tsai, Arbee L. P. Chen |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2001 | Discovering Knowledge From Large Databases Using Prestored Information
Pauray S. M. Tsai |
Inf. Syst. | 1 |
| 1999 | An Efficient Approach for Incremental Association Rule Mining
Pauray S. M. Tsai, Chih-Chong Lee, Arbee L. P. Chen |
PAKDD | 1 |
| 1997 | Optimizing Entity Join Queries when Data Transmission Cost Dominates
Pauray S. M. Tsai, Arbee L. P. Chen |
Data Knowl. Eng. | 1 |
| 1996 | Identifying Object Isomerism in Multidatabase Systems
Arbee L. P. Chen, Pauray S. M. Tsai, Jia-Ling Koh |
Distributed Parallel Databases | 2 |
| 1994 | Optimizing Entity Join Queries by Extended Semijoins in a Wide Area Multidatabase EnvironmentabstractWe consider processing entity join queries in a wide area multidatabase environment where the query processing cost is dominated by the cost of data transmission. An entity join operation "integrates" tuples representing the same entities from different relations in which inconsistent data may exist. The semijoin technique has been successfully used in a distributed database system to reduce the cost of data transmission. However, it cannot be directly applied to process the entity join query. An extension of the traditional semijoin, named extended semijoin is proposed to reduce the cost of data transmission for entity join query processing in a wide area multidatabase environment. Pauray S. M. Tsai, Arbee L. P. Chen |
ICPADS | 1 |