A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A genetic algorithm-based clustering approach for database partitioning
2002
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)
Preserved Fulltext
For this reason, data partitioning and data allocation are performance critical issues in distributed database application design. In this paper, we are dealing with data partitioning. ...
The proposed GA is applied to solve the data-partitioning problem. Our computational study shows that our GA performs well for this application. ...
ACKNOWLEDGMENT The authors wish to thank the anonymous referees for numerous insightful comments, which resulted in important improvements in the paper. ...
doi:10.1109/tsmcc.2002.804444
fatcat:rxmnszxhhjgi7eqw62ppbwoc7a
Data Storage Control System Design
2014
Modern Applied Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Database design is a dynamic area of software development. A variety of problems set leads to designing databases that differ greatly by their characteristics and application purposes. ...
In the ACS design process one of the most important aspects is data access, storage and processing control. ...
Optimisation of the Data Partitioning To solve the problem we must find a proper partitioning * * : ( ) min ( ( )), X J X J X J X X = ∈ , (7) where X is a data partition, X -all possible partitions. ...
doi:10.5539/mas.v9n4p67
fatcat:2evo2dykcrenrdsoqwnacmtmsy
Vertical partitioning algorithms for database design
1984
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Vertical partitioning is applied in three contexts: a database stored on devices of a single type, a database stored in different memory levels, and a distributed database. ...
A two-phase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information. ...
ACKNOWLEDGMENTS Many colleagues have participated in discussions on vertical partitioning, and have inspired some of the concepts used here. ...
doi:10.1145/1994.2209
fatcat:roihrotlwzfjbklaei6gu3sl3e
Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. ...
Via the graph isomorphism problem we organize and classify the polynomial systems we solved. ...
This classification problem could be aided by mining a database of solved problems. ...
arXiv:1506.02618v1
fatcat:jlqvviue3bfnzbroeacjo5vnmu
Relax and Let the Database Do the Partitioning Online
[chapter]
2012
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In contrast to previous work, we express partitioning as a One-Dimensional Partitioning Problem (1DPP), with Horizontal (HPP) and Vertical Partitioning Problem (VPP) being just two variants of it. ...
This is because the DBA has to understand the physical query execution plans for each query in the workload very well to make appropriate design decisions. ...
Introduction Physical database designs have been researched heavily in the past [23, 3, 2, 5, 6, 31, 7, 22, 26, 12] . ...
doi:10.1007/978-3-642-33500-6_5
fatcat:xut3lhp6abdl5kiev7hi4badb4
Additive Pattern Database Heuristics
2004
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In each of these problem domains, either statically partitioned or dynamically partitioned pattern database heuristics are the best known heuristics for the problem. ...
the cost of solving the original problem. ...
We solved the 17-disk problem in 7 seconds and the 18-disk problem in 7 minutes, not counting the time to compute the pattern database. ...
doi:10.1613/jair.1480
fatcat:ll55iutqvfe2tlaea4skjjshky
A hardware/software partitioning algorithm for designing pipelined ASIPs with least gate counts
1996
Proceedings of the 33rd annual conference on Design automation conference - DAC '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The partitioning problem is formalized as a combinatorial optimization problem that partitions the operations into hardware and software so that the HW cost (gate count) of the designed pipelined ASIP ...
A branch-andbound algorithm with proposed lower bound functions is used to solve the presented formalization in the PEAS-I system. ...
This research is supported in part by Grant-in-Aid for Scientific Research Nos. 07558038 and 07680353 from the Ministry of Education, Science and Culture, Japan. ...
doi:10.1145/240518.240618
dblp:conf/dac/BinhISH96
fatcat:5mcffls3x5cajpbfgdb6koclee
Load Balancing Optimization of In-Memory Database for Massive Information Processing of Internet of Things (IoTs)
2022
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In the process of query processing, dynamic scheduler monitors the load of each node in real time and dynamically adjusts the parallelism, so as to realize the load balance of in-memory database and maximize ...
Based on the analysis of the key technologies of the Internet of Things service platform architecture, a load balancing optimization scheme of in-memory database based on the massive information processing ...
In this paper, the random distribution problem in service orientation under ubiquitous computing environment is studied, and the method to solve the np-complete problem is proposed. ...
doi:10.1155/2022/9138084
fatcat:4q6g2mycmzboviybpt3j53yfpm
Coordination of data in heterogenous domains
2010
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We outline methods for solving the data coordination problem using these mappings, and discuss future research problems for data coordination to be realized in heterogeneous domain scenarios that occur ...
In this paper, we describe extensions to the popular GLAV mapping formalism to express such relationships. ...
Section III formulates the data coordination problem, gives the details of our contributions and outlines the proposed algorithm for solving it. ...
doi:10.1109/icdew.2010.5452757
dblp:conf/icde/LawrencePS10
fatcat:pwvjkloiq5gypjnlww7pp44254
Distributed database design methodologies
1987
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We review the design problems and methodologies along both directions, and we describe DATAID-D, a topdown methodology for distribution design. ...
The design of distribution can be performed topdown or bottom-up; the first approach is typical of a distributed database developed from scratch, while the second approach is typical of the development ...
ACKNOWLEDGMENT The authors would like to thank the anonymous referees for providing very useful and detailed comments for revision of this paper. ...
doi:10.1109/proc.1987.13771
fatcat:5zi7n6pq6vhijmkvuw7iplhbke
Parallelizing CAD
2008
Proceedings of the 45th annual conference on Design automation - DAC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our initial results indicate that parallel patterns exist in a broad range of CAD problems. ...
of these design patterns. ...
In fact, we would argue that it is the critical problem in finding fine-grained concurrency in CAD. Currently, we envision two approaches to solve this problem. ...
doi:10.1145/1391469.1391475
dblp:conf/dac/CatanzaroKS08
fatcat:gyirvtvsf5bh3l5l7fevugj4mm
WKNN indoor positioning method based on spatial feature partition and basketball motion capture
2021
Alexandria Engineering Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This is to a certain extent Solved many problems. ...
Specific experimental analysis can prove that the method proposed in this article can solve the problem of low positioning accuracy to a certain extent. Ó 2021 THE AUTHORS. ...
which solves many problems to a certain extent. ...
doi:10.1016/j.aej.2021.04.078
fatcat:tm5sb6txvjakvmocgw5sianeiu
DREAMS and IMAGE: A Model and Computer Implementation for Concurrent, Life-Cycle Design of Complex Systems
1996
Concurrent Engineering - Research and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Built on the successes of initial architectures, requirements for a nextgeneration design computing infrastructure can be developed. ...
These requirements concentrate on those needed by a designer in decision-making processes from product conception to recycling and can be categorized in two areas: design process and design information ...
The DSPT Palette implementation provides an interface for meta-design activities (partitioning a design timeline) and actual designing (solving Support Problems). ...
doi:10.1177/1063293x9600400207
fatcat:6ecrbzrpznd7rk4i7qovbsws4q
An automated, yet interactive and portable DB designer
2010
Proceedings of the 2010 international conference on Management of data - SIGMOD '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It provides close to optimal suggestions for indexes for a given workload by modeling the problem as a combinatorial optimization problem and solving it by sophisticated and mature solvers. ...
get the best out of suggested design features. ...
CoPhy develops a convex combinatorial optimization formulation for the problem of suggesting indexes and then employs mature existing techniques to solve it. ...
doi:10.1145/1807167.1807314
dblp:conf/sigmod/AlagiannisDSAP10
fatcat:geo6u4mfpbge5gooeh4kah3k6e
On Implementing Autonomic Systems with a Serverless Computing Approach: The Case of Self-Partitioning Cloud Caches
2020
Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show that serverless computing cloud services can be leveraged to solve the complex optimization problems that arise during self-tuning loops and can be used to optimize cloud caches for free. ...
To illustrate that our approach is feasible and useful, we implement SPREDS (Self-Partitioning REDiS), a modified version of Redis that optimizes memory management in the multi-instance Redis scenario. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/computers9010014
fatcat:mnmunvinffbfhbrw3mnkp4ds5m
« Previous
Showing results 1 — 15 out of 89,182 results