Propiedad y derechos eclesiásticos en Villavicencio : un litigio entre el abad de Sahagún y el episcopado leonés

En el año 1216 el papa Inocencio III emitía una sentencia en torno a un largo litigio que la sede episcopal de León mantenía con el monasterio de Sahagún por las rentas eclesiásticas de las iglesias del coto monástico que estaban a su vez dentro de la demarcación diocesana leonesa. Vamos a prestar atención al caso concreto de las iglesias de Villavicencio y a la actitud del abad de Sahagún de no satisfacer al obispo de León las tercias decimales que le reclamaba. Ante esta pretensión del episcopado leonés de hacer efectiva su jurisdicción diocesana, el abad de Sahagún esgrimía la posesión de un privilegio papal que le confería inmunidad para percibir en su totalidad las rentas eclesiásticas que se derivaban de estas iglesias. Se trata, por tanto, del análisis de un conflicto jurisdiccional por el acceso a la renta eclesiástica de las iglesias de la villa y una lucha por establecer la primacía de la jurisdicción episcopal por encima de la jurisdicción particular de un monasterio que actúa como un señorío más dentro de la villa.In the year 1216 the Pope Inocencio III issued a judgment about a long dispute between the León episcopate and the monastery of Sahagún, about the ecclesiastical rents of the churches of that monastery territory, that were, at the same time, included in the diocese of León. V\/e will pay special attention to the specific case of the Villavicencio churches, and the attitude of the Sahagún abbot to deny the payment of the tithe tierces claimed by the León bishop. With regard to the episcopate claim to carry out the diocesan rules, the Sahagún abbot argued the possession of a pope privilege consisting of the immunity to obtain the total amount of the ecclesiastical rents from the these churches. Therefore, this is an análisis of a legal conflict for the acquisition of ecclesiastical rents from these churches and the struggle to stablish the primacy of the episcopate jurisdiction over the particular jurisdiction of a monastery; that behaved as one seigniory among others in that village

Lugares de reunión, boni homines y presbíteros en Valdevimbre y Ardón en la Alta Edad Media

El objetivo de este artículo es entender mejor algunos aspectos del desarrollo social y político de las comunidades campesinas de la zona de Ardón y Valdevimbre (al sur de la ciudad de León) en la Alta Edad Media. Los documentos leoneses del siglo X y de la primera mitad del siglo XI nos ofrecen la oportunidad de conocer a algunos miembros de las elites locales a través de reiteradas menciones de boni homines y presbíteros que aparecen en ellos. Este hecho nos está informando de la creciente desigualdad social que se produjo en el seno de estas comunidades. Pero además, la documentación nos informa de la dimensión política de las relaciones de estas comunidades con algunas instituciones eclesiásticas y magnates y, a través de ellos, con el poder central astur-leonés, analizando los cambios de ubicación de los lugares de reunión para la resolución de conflictos surgidos entre los miembros de las comunidades y los de estas elites de poder.The aim of this article is to better understand some features of the social and political development of the peasant communities located at the area of Ardón and Valdevimbre (south of the city of León, Spain) in the Early Middle Ages. Leonese charters from 10th.-11th. centuries shows us the opportunity to know some of the local elite members, if we pay attention to repeated mentions of boni homines (good men) and local priests who appear on these charters. This fact reports us about the increasing social inequality produced inside these peasant communities. We will also explore changes in location of meeting places chosen to solve conflicts between community members and the ones of some ecclesiastical institutions and aristocracy as a way to better know the political side of the relationship between the mentioned peasant communities and those power elites and, through them, with the Astur-leonese central power

Distance Range Queries in SpatialHadoop

Efficient processing of Distance Range Queries (DRQs) is of great importance in spatial databases due to the wide area of applications. This type of spatial query is characterized by a distance range over one or two datasets. The most representative and known DRQs are the ε Distance Range Query (εDRQ) and the ε Distance Range Join Query (εDRJQ). Given the increasing volume of spatial data, it is difficult to perform a DRQ on a centralized machine efficiently. Moreover, the εDRJQ is an expensive spatial operation, since it can be considered a combination of the εDR and the spatial join queries. For this reason, this paper addresses the problem of computing DRQs on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports spatial operations efficiently, and proposes new algorithms in SpatialHadoop to perform efficient parallel DRQs on large-scale spatial datasets. We have evaluated the performance of the proposed algorithms in several situations with big synthetic and real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal

Enhancing SpatialHadoop with Closest Pair Queries

Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds the K closest pairs of objects from P ×Q. It is an operation widely adopted by many spatial and GIS applications. As a combination of the K Nearest Neighbor (KNN) and the spatial join queries, KCPQ is an expensive operation. Given the increasing volume of spatial data, it is difficult to perform a KCPQ on a centralized machine efficiently. For this reason, this paper addresses the problem of computing the KCPQ on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports spatial operations efficiently, and proposes a novel algorithm in SpatialHadoop to perform efficient parallel KCPQ on large-scale spatial datasets. We have evaluated the performance of the algorithm in several situations with big synthetic and real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal

Creating datasets for data analysis through a cloud microservice-based architecture

Data analysis is a trending technique due to the tendency of analyzing patterns or generating knowledge in different domains. However, it is difficult to know at design time what raw data should be collected, how it is going to be analyzed or which analysis techniques will be applied to data. Service-oriented architectures can be applied to solve these problems by providing flexible and reliable architectures. In this paper, we present a microservice-based software architecture in the cloud with the aim of generating datasets to carry out data analysis. This architecture facilitates acquiring data, which may be located in a data center, distributed, or even on different devices (ubiquitous computing) due to the rise of the IoT. It provides an infrastructure over which multiple developer’ groups can work in parallel on the microservices. These microservices also provide a reliable and affordable adaptability to the lack of specific requirements in some functionalities and the fast evolution and variability of them, due to the fast changing of client needs

A Dynamic Equilibrium View of Caching Systems

In this paper, we present a simple analytical study of caching systems based on the idea of dynamic equilibrium of cache blocks, assuming the Independent Reference Model (IRM) of references. This method allows us to obtain simple closedform expressions for parameters that are usually excluded from cache studies, such as the mean number of reads or writes per cache block while in the cache. We finally present some simulation results in order to validate the analysis.Ministerio de Educación y Ciencia TIN2006-15617- C03-03Junta de Andalucía P06-TIC-229

Efficient Large-scale Distance-Based Join Queries in SpatialHadoop

Efficient processing of Distance-Based Join Queries (DBJQs) in spatial databases is of paramount importance in many application domains. The most representative and known DBJQs are the K Closest Pairs Query (KCPQ) and the ε Distance Join Query (εDJQ). These types of join queries are characterized by a number of desired pairs (K) or a distance threshold (ε) between the components of the pairs in the final result, over two spatial datasets. Both are expensive operations, since two spatial datasets are combined with additional constraints. Given the increasing volume of spatial data originating from multiple sources and stored in distributed servers, it is not always efficient to perform DBJQs on a centralized server. For this reason, this paper addresses the problem of computing DBJQs on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports efficient processing of spatial queries in a cloud-based setting. We propose novel algorithms, based on plane-sweep, to perform efficient parallel DBJQs on large-scale spatial datasets in Spatial Hadoop. We evaluate the performance of the proposed algorithms in several situations with large real-world as well as synthetic datasets. The experiments demonstrate the efficiency and scalability of our proposed methodologies