Sciweavers

2223 search results - page 42 / 445
» Query Optimization in an OODBMS
Sort
View
NIPS
2008
15 years 1 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
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 2 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
PODS
2004
ACM
100views Database» more  PODS 2004»
15 years 12 months ago
Weighted Hypertree Decompositions and Optimal Query Plans
Francesco Scarcello, Gianluigi Greco, Nicola Leone
ICDE
2008
IEEE
144views Database» more  ICDE 2008»
16 years 1 months ago
QShuffler: Getting the Query Mix Right
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing perf...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
16 years 1 months ago
Query Estimation by Adaptive Sampling
The ability to provide accurate and efficient result estimations of user queries is very important for the query optimizer in database systems. In this paper, we show that the tra...
Yi-Leh Wu, Divyakant Agrawal, Amr El Abbadi