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 14 papers published in subject: > since this site started. |
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. Random extraction problem based on MySQL database | |||
Zhang Zishi,Huang Jianming | |||
Computer Science and Technology 08 April 2020 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Considering the random extraction problem based on the database, we establish a model to solve the random extraction problem. We analyze the reason why random extraction of databases is needed and study a random database extraction method widely used. We propose and analyze the Equidistant Extraction Method (EEM) for uniform extraction, and then we propose the Weight Correlation Extraction Method (WCEM) for non-uniform extraction. Finally, we test the two schemes. It is proved by the test that EEM and WCEM can both implement the purpose of random extraction, and have the characteristics of uniform extraction and non-uniform extraction respectively. | |||
TO cite this article:Zhang Zishi,Huang Jianming. Random extraction problem based on MySQL database[OL].[ 8 April 2020] http://en.paper.edu.cn/en_releasepaper/content/4751352 |
3. ROSIE: Runtime Optimization of SPARQL Queries Using Incremental Evaluation | |||
GAI Lei, CHEN Wei, WANG Teng-Jiao | |||
Computer Science and Technology 17 April 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Currently, relational databases are wildly adopted in RDF (Resource Description Framework) data management, but they show problematic performance in SPARQL query evaluation. One important factor is how to tackle the suboptimal query plan caused by error-prone cardinaltiy estimation. Consider the schema-free nature of RDF data and the extsc{Join}-intensive characteristic of SPARQL query, determine an optimal query plan is costly or even infeasible, especially for complex queries on large-scale data. In this paper, we propose ROSIE, a underline{R}untime underline{O}ptimization framework that iteratively re-optimize the underline{S}PARQL query plan accroding to the actual cardinality derived from underline{I}ncremental partial query underline{E}valuation. By introducing a heuristic-based plan generation approach, as well as a mechanism to detect cardinaltiy estimation error at runtime, ROSIE relieves the problem of biased cardinality propagation, and thus is more resilient to complex query evaluation. Extensive experiments on real and benchmark data show that compared to the state-of-the-arts, ROSIE can improve query performance by orders of magnitude. | |||
TO cite this article:GAI Lei, CHEN Wei, WANG Teng-Jiao. ROSIE: Runtime Optimization of SPARQL Queries Using Incremental Evaluation[OL].[17 April 2017] http://en.paper.edu.cn/en_releasepaper/content/4725396 |
4. A General Research on Database Migration from RDBMS to HBase | |||
Fu Zhicheng,Liu Chen | |||
Computer Science and Technology 09 March 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In an information-based world, there needs the support of big data. But the emergence of large data makes the various shortcomings of RDBMS exposed. The application of distributed database HBase can solve this problem. Based on HBase, a very popular distributed database, this paper proposes a method to migrate database which is on the huge amounts of data from RDBMS to HBase and proves the significance of this database migration method via the test result. | |||
TO cite this article:Fu Zhicheng,Liu Chen. A General Research on Database Migration from RDBMS to HBase[OL].[ 9 March 2015] http://en.paper.edu.cn/en_releasepaper/content/4633699 |
5. Efficiently Processing Subspace l-SkyRex Queries | |||
HUANG Zhenhua,SUN Shengli | |||
Computer Science and Technology 21 February 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Subspace l-SkyRex query processing has recently received a lot of attention in database community. Given a set of multidimensional objects, l-SkyRex query on Subspace V finds the objects that are dominated by at most l objects on this subspace. In multi-user environments, skyline analysis systems need the capabilities to optimize multiple subspace l-SkyRex queries simultaneously. Therefore, for this purpose, we also propose AOMSSQ (Algorithm for Optimizing Multiple Subspace l-SkyRex Queries), the first efficient sound and complete algorithm to optimize multiple subspace l-SkyRex queries in multi-user environments. Finally, we discuss two interesting variations of subspace l-SkyRex query, i.e., global constraint subspace l-SkyRex query and local constraint subspace l-SkyRex query, which are meaningful in practice, and show how our solutions can be applied for their efficient processing. Detailed theoretical analyses and extensive experiments that demonstrate our algorithms are both efficient and effective. | |||
TO cite this article:HUANG Zhenhua,SUN Shengli. Efficiently Processing Subspace l-SkyRex Queries[OL].[21 February 2013] http://en.paper.edu.cn/en_releasepaper/content/4520904 |
6. Re-formulating Metadata for Privacy-aware Access Control in Information Sharing | |||
Liu Yimin,Wang Zhihui, Wang Wei, Li Qiuhong | |||
Computer Science and Technology 10 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the extensive use of XML technology in data transmission and sharing, access control for sensitive and private XML data becomes one of the urgent problems. This paper has proposed an approach based on the minimum secure access tree, which reconstructs the purpose-based metadata model and thus effectively implements privacy-aware data access control. In the approach, the metadata model of purpose is a purpose-based secure access trees, which can be further broken to a group of path expression of xpath {/,//,[ ]} fragments pointing to a set of privacy nodes in the tree. By removing the redundant paths and reducing the number of data nodes, this paper can describe the purpose-based access control policy with the minimum secure access tree. Based on the idea of the xpath fragments query containing, this paper has furthermore presented the algorithms for generating purpose-based minimum secure access tree and implementing privacy-aware data access control mechanism for XML data. The experimental results show that the approach can prevent well the leakage of private XML data, and the query time mainly depends on the structural complexity of query xpath {/,//,[ ]} and the number of nodes on the query path. | |||
TO cite this article:Liu Yimin,Wang Zhihui, Wang Wei, et al. Re-formulating Metadata for Privacy-aware Access Control in Information Sharing[OL].[10 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464890 |
7. A Graph-Based Conflict-Aware Load-Balancing Algorithm for Database Replication | |||
Zheng Angen,Liao Jianxin,Wang Jing,Zhu Xiaomin | |||
Computer Science and Technology 25 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a novel graph-based conflict-aware load-balancing algorithm: GBCA (Graph-Based Conflict-Aware) for certification-based database replication protocols to increase the concurrency and reduce the aborts due to the lack of synchronization during transaction executions. GBCA represents all concurrent transactions in the system and their conflict relationship using a graph, where transactions are represented by nodes and transaction conflicts are represented by edges connecting the inter-conflicting transactions. Node weights account for the complexity of transactions, while edge weights account for the odds of conflicting between different transaction types. We then apply a graph partitioning algorithm to splits this graph into k(the number of replicas) disjoin subsets such that the sum of the edge-weights spanning subsets, called edge-cut, is minimized, while subjecting to the constraint that the sum of the vertex-weights in each subset is balanced and that the virtual nodes (Each database server is represented as a virtual node) are splits into k distinct subsets. Thus, each subset has a unique virtual node which indicates the replica that the transactions of this subset should be assigned to. This graph operation approximates minimizing the number of inter-conflicting transaction executing on different replicas while balancing the load evenly across replicas. At each replica, we adopt a conflict-aware load control technique to avoid data contention thrashing casued by the concentration of inter-conflicting transactions to a single node. | |||
TO cite this article:Zheng Angen,Liao Jianxin,Wang Jing, et al. A Graph-Based Conflict-Aware Load-Balancing Algorithm for Database Replication[OL].[25 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4455344 |
8. Detection of High-risk Zones and Potential Infected Neighbors from Infectious Disease Monitoring Data | |||
TAN Biying,DUAN Lei,GOU Chi,HUANG Shuyang,FANG Yuhao,ZHAO Xing,TANG Changjie | |||
Computer Science and Technology 23 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Detecting the high-risk zones as well as potential infected geographical neighbor is necessary and important to reduce the loss caused by infectious disease. However, it is a challenging work, since the outbreak of infectious disease is uncertain and unclear. Moreover, the detection should be efficient otherwise the best control and prevention time may be missed. To deal with this problem, we propose a geography high-risk zones detection method by capturing the significant change in the infectious disease monitoring data. The main contribution of this paper includes: (1) Analyzing the challenges of the early warning and detection of infectious disease outbreak; (2) Proposing a method to detect the zone that the number of monitoring cases changes significantly; (3) Defining the infection perturbation to describe the infection probability between two zones; (4) Designing an algorithm to measure the infection perturbation of infectious disease between adjacent zones; (5) Performing extensive experiments on both real-world data and synthetic data to demonstrate the effectiveness and efficiency of the proposed methods. | |||
TO cite this article:TAN Biying,DUAN Lei,GOU Chi, et al. Detection of High-risk Zones and Potential Infected Neighbors from Infectious Disease Monitoring Data[OL].[23 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4457230 |
9. MCCI: Mining Compact Contrast Inequality with Preferred Functions | |||
DUAN Lei,TANG Changjie,ZUO Jie,ZHANG Tianqing | |||
Computer Science and Technology 23 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Contrast inequality is a new analysis tool to describe the contrast relationship between classes of data in the form of inequality. A Gene Expression Programming (GEP) based method has been proposed for contrast inequality mining in previous work. However, the method does not consider the comprehensibility and clarity of the discovered contrast inequality. The main contributions of this paper include: (1) introducing a compactness measure for contrast inequality, (2) designing a method, named MCCI, to discover compact contrast inequalities with preferred functions, (3) discussing some strategies used in MCCI to keep the compactness measure efficient, and (4) giving an extensive performance study on several data sets from UCI Machine Learning Repository. The experimental results show that MCCI is effective for mining compact contrast inequalities with high discriminative power. And domain knowledge can be introduced in MCCI to evolve inequalities containing preferred functions. | |||
TO cite this article:DUAN Lei,TANG Changjie,ZUO Jie, et al. MCCI: Mining Compact Contrast Inequality with Preferred Functions[OL].[23 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4457190 |
10. An Improved Unsupervised Phenotypes Structure Discovery Algorithm for Gene Expression Data | |||
ZHAO Yuhai,LI Yuan | |||
Computer Science and Technology 21 January 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Phenotype structure discovery is a significant problem in bioinformatics. However, it receives less attension from an unsupervise learning perspective. This paper proposes an unsupervised phenotype structure discovery algorithm, namely UPID, to simultaneously mine phenotypes and informative genes from gene expression data. By adopting incremental computing optimization strategies, the calculation of UPID is greatly reduced. Furthermore, UPID decreases the impact of outliers by taking the sample proportion of each group into consideration, which makes the model more robust. Experiments conducted on several real gene expression datasets shows that UPID outperforms HS, a previous pattern detection method for gene expression data. | |||
TO cite this article:ZHAO Yuhai,LI Yuan. An Improved Unsupervised Phenotypes Structure Discovery Algorithm for Gene Expression Data[OL].[21 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4408235 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated