✦ LIBER ✦

Optimizing complex queries based on similarities of subqueries

✍ Scribed by Qiang Zhu; Yingying Tao; Calisto Zuzarte

Book ID: 106280231
Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 886 KB
Volume: 8
Category: Article
ISSN: 0219-1377
DOI: 10.1007/s10115-004-0189-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adaptive document clustering based on qu

Adaptive document clustering based on query-based similarity

✍ Seung-Hoon Na; In-Su Kang; Jong-Hyeok Lee 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Massive RDF Data Complicated Query Optim

Massive RDF Data Complicated Query Optimization Based on MapReduce

✍ Jieru Cheng; Wenjun Wang; Rui Gao 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 193 KB

A comparison of collocation-based simila

A comparison of collocation-based similarity measures in query expansion

✍ Myoung-Cheol Kim; Key-Sun Choi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Dynamic optimization of queries in pivot

Dynamic optimization of queries in pivot-based indexing

✍ Svein Erik Bratsberg, Magnus Lie Hetland 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 320 KB

Automatic feature-queried bird identific

Automatic feature-queried bird identification system based on entropy and fuzzy similarity

✍ Xingqi Wang; Thorsten Schiner; Xin Yao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 499 KB

On the Complexity of Database Queries

✍ Christos H. Papadimitriou; Mihalis Yannakakis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory. We show that, if the query size (or the number of variables in the query) is considered as a parameter, then the relational calculus and its fragments (conjunctive queri