ICDE
2012
IEEE
12 years 1 months ago
2012
IEEE
— XML is commonly supported by SQL database systems. However, existing mappings of XML to tables can only deliver satisfactory query performance for limited use cases. In this pa...
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
13 years 2 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
MMS
2011
13 years 6 months ago
2011
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
SIGOPS
2010
13 years 9 months ago
2010
Information management applications exhibit a wide range of query performance and result freshness goals. Some applications, such as web search, require interactive performance, b...
IS
2006
13 years 11 months ago
2006
The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-con...
IJAHUC
2008
13 years 11 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
SBBD
2004
14 years 24 days ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
ECIR
2007
Springer
14 years 26 days ago
2007
Springer
We consider the issue of query performance, and we propose a novel method for automatically predicting the difficulty of a query. Unlike a number of existing techniques which are b...
CIKM
2008
Springer
14 years 1 months ago
2008
Springer
The focus of research on query performance prediction is to predict the effectiveness of a query given a search system and a collection of documents. If the performance of queries...
EDBT
2000
ACM
14 years 3 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...