Sciweavers

Share
ICDE
2012
IEEE
298views Database» more  ICDE 2012»
7 years 12 months ago
Mapping XML to a Wide Sparse Table
— 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...
Liang Jeff Chen, Philip A. Bernstein, Peter Carlin...
DLOG
2011
9 years 27 days ago
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
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 ...
Eufemia Tinelli, Francesco M. Donini, Michele Ruta...
MMS
2011
9 years 4 months ago
Dynamic behavior of balanced NV-trees
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
Arnar Ólafsson, Björn Þór...
SIGOPS
2010
84views more  SIGOPS 2010»
9 years 7 months ago
LazyBase: freshness vs. performance in information management
Information management applications exhibit a wide range of query performance and result freshness goals. Some applications, such as web search, require interactive performance, b...
Kimberly Keeton, Charles B. Morrey III, Craig A. N...
IS
2006
9 years 9 months ago
Query performance prediction
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...
Ben He, Iadh Ounis
IJAHUC
2008
118views more  IJAHUC 2008»
9 years 9 months ago
Analysis models for unguided search in unstructured P2P networks
: 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...
Bin Wu, Ajay D. Kshemkalyani
SBBD
2004
106views Database» more  SBBD 2004»
9 years 10 months ago
Twisting the Metric Space to Achieve Better Metric Trees
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...
César Feijó Nadvorny, Carlos A. Heus...
ECIR
2007
Springer
9 years 10 months ago
Query Hardness Estimation Using Jensen-Shannon Divergence Among Multiple Scoring Functions
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...
Javed A. Aslam, Virgiliu Pavlu
CIKM
2008
Springer
9 years 11 months ago
A survey of pre-retrieval query performance predictors
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...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong
EDBT
2000
ACM
10 years 1 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
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 ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
books