Sciweavers

2546 search results - page 180 / 510
» Managing long-running queries
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 10 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
CIKM
2006
Springer
15 years 10 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
CIKM
2009
Springer
15 years 10 months ago
Learning from past queries for resource selection
Federated text search provides a unified search interface for multiple search engines of distributed text information sources. Resource selection is an important component for fed...
Suleyman Cetintas, Luo Si, Hao Yuan
INFOSCALE
2007
ACM
15 years 8 months ago
Mining query logs to optimize index partitioning in parallel web search engines
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
TSC
2008
91views more  TSC 2008»
15 years 6 months ago
Selective Querying for Adapting Web Service Compositions Using the Value of Changed Information
Web service composition (WSC) techniques assume that the parameters used to model the environment remain static and accurate throughout the composition's execution. However, W...
John Harney, Prashant Doshi