Sciweavers

Share
CIKM
2006
Springer
10 years 2 months ago
Ranking robustness: a novel framework to predict query performance
In this paper, we introduce the notion of ranking robustness, which refers to a property of a ranked list of documents that indicates how stable the ranking is in the presence of ...
Yun Zhou, W. Bruce Croft
VLDB
1998
ACM
101views Database» more  VLDB 1998»
10 years 2 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
EDBT
1998
ACM
155views Database» more  EDBT 1998»
10 years 2 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
SIGMOD
1998
ACM
124views Database» more  SIGMOD 1998»
10 years 2 months ago
An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees
The Relational On-Line Analytical Processing (ROLAP) is emerging as thedominant approach in data warehousing with decision support applications. In order to enhance query performa...
Yannis Kotidis, Nick Roussopoulos
FOCS
2000
IEEE
10 years 3 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SPIRE
2004
Springer
10 years 4 months ago
Inferring Query Performance Using Pre-retrieval Predictors.
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-cons...
Ben He, Iadh Ounis
SKG
2005
IEEE
10 years 4 months ago
An Interest-based P2P RDF Query Architecture
Currently most centralized RDF storage and query architectures have problems in query performance and scalability. In this paper we present a distributed RDF query architecture to ...
Qian Gao, Zhihuan Qiu, Yu Wu, Jing Tian, Yafei Dai
SIGMOD
2002
ACM
172views Database» more  SIGMOD 2002»
10 years 10 months ago
Automating physical database design in a parallel database
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
10 years 11 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
ICDE
1998
IEEE
147views Database» more  ICDE 1998»
10 years 12 months ago
The Effect of Buffering on the Performance of R-Trees
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
Scott T. Leutenegger, Mario A. Lopez
books