Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
152
Dynamic Memory Allocation for Multiple-Query Workloads
- In VLDB
, 1993
"... This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate the i ..."
Abstract
-
Cited by 45 (3 self)
- Add to MetaCart
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate
Dynamic Memory Allocation for Large Query Execution
"... ABSTRACT. 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 and even lead to system thrashing because of paging. However, memory management optimization is hard to incorp ..."
Abstract
- Add to MetaCart
to incorporate in a query optimizer because of cost estimate errors. In this paper, we address the problem of efficient memory management for large query execution. We propose a static memory allocation scheme applied at start-up time, and a more efficient dynamic execution model which performs memory
Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets
- Journal of Artificial Intelligence Research
, 1997
"... This paper introduces new algorithms and data structures for quick counting for machine learning datasets. We focus on the counting task of constructing contingency tables, but our approach is also applicable to counting the number of records in a dataset that match conjunctive queries. Subject to c ..."
Abstract
-
Cited by 146 (20 self)
- Add to MetaCart
-case bounds for this structure for several models of data distribution. We empirically demonstrate that tractably-sized data structures can be produced for large real-world datasets by (a) using a sparse tree structure that never allocates memory for counts of zero, (b) never allocating memory for counts
Multiclass Query Scheduling in Real-Time Database Systems
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 1995
"... In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emer-gence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Pr ..."
Abstract
-
Cited by 37 (0 self)
- Add to MetaCart
according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system’s admission, mem-ory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms
Scheduling Queries Across Replicas
"... For increased efficiency, an information retrieval system can split its index into multiple shards, and then replicate these shards across many query servers. For each new query, an appropriate replica for each shard must be selected, such that the query is answered as quickly as possible. Typically ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. Typically, the replica with the lowest number of queued queries is selected. However, not every query takes the same time to execute, particularly if a dynamic pruning strategy is applied by each query server. Hence, the replica’s queue length is an inaccurate indicator of the workload of a replica, and can
Query suspend and resume
- In: SIGMOD (2007
"... ABSTRACT Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to run it immediately with all available resources. We have several choices. We could swap out the old query to disk ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
ABSTRACT Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to run it immediately with all available resources. We have several choices. We could swap out the old query
Learning to Predict Response Times for Online Query Scheduling
- In Proc. SIGIR 2012
"... Dynamic pruning strategies permit efficient retrieval by not fully scoring all postings of the documents matching a query – without degrading the retrieval effectiveness of the topranked results. However, the amount of pruning achievable for a query can vary, resulting in queries taking different am ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
amounts of time to execute. Knowing in advance the execution time of queries would permit the exploitation of online algorithms to schedule queries across replicated servers in order to minimise the average query waiting and completion times. In this work, we investigate the impact of dynamic pruning
Dumb money: Mutual fund flows and the cross section of stock returns,
- Journal of Financial Economics,
, 2008
"... We thank Nicholas Barberis and Judith Chevalier for helpful comments. We thank Breno Schmidt for research assistance. ABSTRACT We use mutual fund flows as a measure for individual investor sentiment for different stocks, and find that high sentiment predicts low future returns. Fund flows are dumb ..."
Abstract
-
Cited by 103 (4 self)
- Add to MetaCart
funds but only $20 billion to Fidelity funds, despite the fact that Fidelity had more than three times the assets under management at the beginning of the year. Thus in 1999 retail investors as a group made an active allocation decision to give greater weight to Janus funds, and in doing so
Dynamic memory allocation policies for postings in real-time twitter search
- In arXiv:1302.5302
, 2013
"... We explore a real-time Twitter search application where tweets are arriving at a rate of several thousands per second. Real-time search demands that they be indexed and searchable immediately, which leads to a number of implementation challenges. In this paper, we focus on one aspect: dynamic postin ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
conservative is slow and leads to fragmented postings lists. We present a dynamic postings allocation policy that allocates memory in increasingly-larger “slices ” from a small number of large, fixed pools of memory. With an analytical model and experiments, we explore different settings that balance time
Results 1 - 10
of
152
