Structural join is the core part of XML queries and has a significant impact on the performance of XML queries, several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. We first extend the relationships between nodes to the relationships between partitions in the...

We investigate the shellability of polyhedral join $\mathcal{Z}^*_M (K, L)$ simplicial complexes $K, M$ and a subcomplex $L \subset K$. give sufficient conditions necessary on $(K, for being shellable. In particular, we show that some pairs L)$, becomes shellable regardless whether $M$ is or not. Polyhedral joins can be applied to graph theory as independence complex certain generalized version...

With the growing popularity of spatial applications, there has been a signiicant increase in the use of database systems for storing and querying spatial data. Spatial data is now readily available from a variety of sources including government mapping agencies, commercial sources, satellite images, and simulation outputs. As this trend continues, applications continue to execute increasingly c...

Energy Communities (EC) are becoming a major driver to foster the energy transition in Europe and regulatory framework adopted by each Member State (MS) plays key role for prosperous deployment of ECs. This paper is thus divided into two layers. The first layer this addresses current regulations introduced MSs regarding ECs, providing critical comparison solution used. second research concerns ...

We propose a new algorithm called Stripe join for performing a join given a join index Stripe join is inspired by an algorithm called Jive join developed by Li and Ross Stripe join makes a single sequential pass through each input relation in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identi ers but no input tuples Stripe join pe...