View selection using randomized search
نویسندگان
چکیده
منابع مشابه
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time constraints. Existing methods provide good results but their high execution cost limits their applicability for large problems. In this paper, we explore the application of randomized, local search algorithms to the view...
متن کاملMulti-view Recognition Using Weighted View Selection
In this paper, we present an algorithm for multi-view recognition in a distributed camera setting that learns which viewpoints are most discriminative for particular instances of ambiguity. Our method is built on top of 2D recognition algorithms and casts view selection as the problem of optimizing kernel weights in multiple kernel learning. The main contribution is a locality-sensitive meta-tr...
متن کاملPractical Illustration of Text: Customized Search, View Selection, and Annotation
This poster presents concepts to support authors illustrating their texts. We introduce a system which smoothly integrates the search and adaptation of appropriate illustrations into target documents. It enables the author to search for images and 3D models. To effectively support the context of the document, the view and label layout of the retrieved 3D models can be semi-automatically adjuste...
متن کاملSpeeding Up Materialized View Selection in Data Warehouses Using a Randomized Algorithm
A data warehouse stores information that is collected from multiple, heterogeneous information sources for the purpose of complex querying and analysis. Information in the warehouse is typically stored in the form of materialized views, which represent pre-computed portions of frequently asked queries. One of the most important tasks when designing a warehouse is the selection of materialized v...
متن کاملFeature selection using tabu search method
Selecting an optimal subset from original large feature set in the design of pattern classi"er is an important and di$cult problem. In this paper, we use tabu search to solve this feature selection problem and compare it with classic algorithms, such as sequential methods, branch and boundmethod, etc., and most other suboptimal methods proposed recently, such as genetic algorithm and sequential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data & Knowledge Engineering
سال: 2002
ISSN: 0169-023X
DOI: 10.1016/s0169-023x(02)00045-9