Sciweavers

716 search results - page 75 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
DATAMINE
1998
106views more  DATAMINE 1998»
15 years 1 months ago
Discovering Robust Knowledge from Databases that Change
Many applications of knowledge discovery and data mining such as rule discovery for semantic query optimization, database integration and decision support, require the knowledge t...
Chun-Nan Hsu, Craig A. Knoblock
ALT
2000
Springer
15 years 6 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
DKE
2007
101views more  DKE 2007»
15 years 1 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
PVLDB
2008
122views more  PVLDB 2008»
15 years 1 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
FOCS
1998
IEEE
15 years 6 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello