Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
50
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
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
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
Decentralized Dynamic Query Optimization based on Mobiles Agents for Large Scale Data Integration Systems
"... The query processing in large scale distributed mediations systems raises new problems and presents real challenges: efficiency of access, communication, confidentiality of access, availability of data, memory allocation. In this paper, we propose an execution model based on mobile agents for the di ..."
Abstract
- Add to MetaCart
The query processing in large scale distributed mediations systems raises new problems and presents real challenges: efficiency of access, communication, confidentiality of access, availability of data, memory allocation. In this paper, we propose an execution model based on mobile agents
Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching
- in: Proceedings of the International Conference on Information and Knowledge Management, ACM CIKM
, 2002
"... For many applications, it is important to quickly locate the nearest neighbor of a given time series. When the given time series is a streaming one, nearest neighbors may need to be found continuously at all time positions. Such a standing request is called a continuous nearest neighbor query. This ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
-fetching. Specifically, pre-fetching is to predict the next value of the stream before it arrives, and to process the query as if the predicted value were the real one in order to load the needed index pages and time series into the allocated cache memory. Furthermore, if the pre-fetched candidates cannot fit
SAO: A Stream Index for Answering Linear Optimization Queries
"... Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To efficiently answer such queries against a large relation, an onion index was previously proposed to properly organize all the t ..."
Abstract
- Add to MetaCart
from the SAO index the approximate top-K tuples in the sliding window almost instantly. The larger the amount of available memory, the better the quality of the answers is. More importantly, for a given amount of memory, the quality of the answers can be further improved by dynamically allocating a
Results 1 - 10
of
50
