Sciweavers

848 search results - page 50 / 170
» Optimization of Sequence Queries in Database Systems
Sort
View
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 9 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
14 years 2 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
VLDB
1998
ACM
108views Database» more  VLDB 1998»
14 years 1 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
ADBIS
2005
Springer
100views Database» more  ADBIS 2005»
14 years 2 months ago
Evolutionary Learning of Boolean Queries by Genetic Programming
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
Suhail S. J. Owais, Pavel Krömer, Václ...
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
14 years 10 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...