Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 2 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. A Database Architecture of E-commerce System with High Availability and Scalability based on MySQL and Redis | |||
CUI Yansong,BAI Chunyu | |||
Computer Science and Technology 11 January 2021 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the continuous development of e-commerce systems, data storage has become a crucial technology in this era, and building a database environment with high-availability has become an urgent demand of many enterprises. In order to prevent web application crashes caused by database server downtime, this paper proposes a database architecture of e-commerce system with high availability and scalability based on MySQL and Redis. The architecture implements read-write separation and automatic switching when the server goes down to ensure high availability of e-commerce systems. It uses the sentinel to build Redis cluster, while reducing database access pressure and preventing cache invalidation caused by Redis server downtime. It builds a database cluster based on MySQL replication, which can ensure real-time synchronization and disaster recovery of data between database servers and improve scalability of system. Finally, this paper implemented an e-commerce system based on this architecture. | |||
TO cite this article:CUI Yansong,BAI Chunyu. A Database Architecture of E-commerce System with High Availability and Scalability based on MySQL and Redis[OL].[11 January 2021] http://en.paper.edu.cn/en_releasepaper/content/4753448 |
2. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner | |||
Xiaoyun Chen,Huiling Liu,Pengfei Chen,Longjie Li | |||
Computer Science and Technology 02 September 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a novel data-mining algorithm, called LPS-Miner, to mine the complete frequent patterns in the transaction database. LPS-Miner algorithm bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light Partial-Support FP-Tree Forest) to present the database. LPS-FP-Tree is a variation of FP-Tree with lighter and unidirectional nodes and mining process depends on partial-support of the patterns. The algorithm adopts partition and divide-and-conquer strategies in maximum, which decomposes the mining task into a set of smaller tasks. The light data structure and the efficient memory management mechanism keep the memory usage stable and efficient. Moreover, other implementation-based optimizations, such as pruning and outputting-optimization, make the algorithm achieve high efficiency. We test our c++ implementation of this algorithm versus several other algorithms on four datasets. The experimental results show that our algorithm has better space and time efficiency. | |||
TO cite this article:Xiaoyun Chen,Huiling Liu,Pengfei Chen, et al. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner[OL].[ 2 September 2008] http://en.paper.edu.cn/en_releasepaper/content/23675 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated