Sciweavers

2217 search results - page 157 / 444
» Rank-aware Query Optimization
Sort
View
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
15 years 10 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan
178
Voted
NIPS
2008
15 years 7 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
NIS
1998
131views more  NIS 1998»
15 years 6 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 7 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 6 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera