Forecasting stock prices, a task complicated by the inherent volatility of the stock market, poses a significant challenge. The ability to accurately forecast stock prices is crucial, as it provides investors with crucial insights, enabling them to make informed strategic decisions. In this paper, we propose a novel investment strategy that relies on predicting stock prices. Our approach utilizes a hybrid predictive model that combines light gradient-boosting machine (LightGBM) and extreme gradient boosting (XGBoost). This model is designed to generate short to medium-term forecasts for a wide range of stocks. The strategy has shown promising results, surpassing the local market indices used as benchmarks in terms of both risk and return. Our findings demonstrate the strategy's effectiveness in both upward and downward market trends, underscoring its potential as a robust tool for portfolio management in diverse market conditions.
The graph model enables a broad range of analyses; thus, graph processing (GP) is an invaluable tool in data analytics. At the heart of every GP system lies a concurrent graph data structure that stores the graph. Such a data structure needs to be highly efficient for both graph algorithms and queries. Due to the continuous evolution, the sparsity, and the scale-free nature of real-world graphs, GP systems face the challenge of providing an appropriate graph data structure that enables both fast analytical workloads and fast, low-memory graph mutations. Existing graph structures offer a hard tradeoff among read-only performance, update friendliness, and memory consumption upon updates. In this paper, we introduce CSR++, a new graph data structure that removes these tradeoffs and enables both fast read-only analytics, and quick and memory-friendly mutations. CSR++ combines ideas from CSR, the fastest read-only data structure, and adjacency lists (ALs) to achieve the best of both worlds. We compare CSR++ to CSR, ALs from the Boost Graph Library (BGL), and the following state-of-the-art update-friendly graph structures: LLAMA, STINGER, GraphOne, and Teseo. In our evaluation, which is based on popular GP algorithms executed over real-world graphs, we show that CSR++ remains close to CSR in read-only concurrent performance (within 10% on average) while significantly outperforming CSR (by an order of magnitude) and LLAMA (by almost 2×) with frequent updates. We also show that both CSR++’s update throughput and analytics performance exceed those of several state-of-the-art graph structures while maintaining low memory consumption when the workload includes updates.
Because of their interesting properties, web services have grown in popularity and have become the preferred technology for distributed systems development. It is then necessary to find efficient solutions for web service composition that can deal with large amounts of services. However, in order to coordinate the exchanges of the data flow in a combination of services, different control structures can contribute, which will complicate the search for an optimal composition. Moreover, the time constraints as well as the increasing number of services also complicate the problem of the composition. In this paper, we presents a formalization of the web Service composition problem as a search problem in an AND/OR Service Dependency Graph, where nodes represent available services and arcs represent the semantic input/output dependencies among them. A set of dynamic optimization techniques have been included to reduce the size of this graph and thus improve the scalability and performance of our approach. We pre-compute all the shortest paths between each pair of this graph's nodes using a graph search algorithm. These paths will be used upon the receipt of a client request, and this reduces the running cost. Furthermore, our model is not only capable of dealing with sequence relations and fork relations, but also capable of dealing with parallel relations between services.
Graph analytics has grown increasingly popular as a model for data analytics across a variety of domains. This has prompted an emergence of solutions for large-scale graph analytics, many of which integrate user-facing domain-specific languages (DSLs) to support graph processing operations. These DSLs fall into two categories: query-based DSLs for graph-pattern matching and graph algorithm DSLs. While graph query DSLs are now standardized, research on DSLs for algorithmic graph processing remains fragmented and lacks a cohesive framework. To address this gap, we conduct a systematic literature review of algorithmic graph processing DSLs aimed at large-scale graph analytics. Our findings reveal the prevalence of property graphs (with 60% of surveyed DSLs explicitly adopting this model), as well as notable similarities in syntax and features. This allows us to identify a common template that can serve as the foundation for a standardized graph algorithm model, improving portability and unifying design between different DSLs and graph analytics toolkits. We additionally find that, despite achieving remarkable performance and scalability, only 20% of surveyed DSLs see real-life adoption. Incidentally, all DSLs for which user documentation is available are developed as part of academia–industry collaborations or in fully industrial contexts. Based on these results, we provide a comprehensive overview of the current research landscape, along with a roadmap of recommendations and future directions to enhance reusability and interoperability in large-scale graph analytics across industry and academia.