Keyword Join: Realizing Keyword Search in P2P-based Database Systems

In this paper, we present a P2P-based database sharing system that provides information sharing capabilities through keyword-based search techniques. Our system requires neither a global schema nor schema mappings between different databases, and our keyword-based search algorithms are robust in the presence of frequent changes in the content and membership of peers. To facilitate data integration, we introduce keyword join operator to combine partial answers containing different keywords into complete answers. We also present an efficient algorithm that optimize the keyword join operations for partial answer integration. Our experimental study on both real and synthetic datasets demonstrates the effectiveness of our algorithms, and the efficiency of the proposed query processing strategies.

Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Combining RTSJ with Fork/Join: a priority-based model

This paper discusses the increased need to support dynamic task-level parallelism in embedded real-time systems and proposes a Java framework that combines the Real-Time Specification for Java (RTSJ) with the Fork/Join (FJ) model, following a fixed priority-based scheduling scheme. Our work intends to support parallel runtimes that will coexist with a wide range of other complex independently developed applications, without any previous knowledge about their real execution requirements, number of parallel sub-tasks, and when those sub-tasks will be generated.

Using a prioritized MAC protocol to execute the database operation join in networked embedded computer systems

Database query languages on relations (for example SQL) make it possible to join two relations. This operation is very common in desktop/server database systems but unfortunately query processing systems in networked embedded computer systems currently do not support this operation; specifically, the query processing systems TAG, TinyDB, Cougar do not support this. We show how a prioritized medium access control (MAC) protocol can be used to efficiently execute the database operation join for networked embedded computer systems where all computer nodes are in a single broadcast domain.

Join The Moment Transitários, S.A: relatório de estágio no departamento de operações

Apresentado ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Empreendedorismo e Internacionalização, sob orientação da Doutora Maria Clara Pinto Ribeiro

Holistic Analysis for Fork-Join Distributed Tasks supported by the FTT-SE Protocol

11th IEEE World Conference on Factory Communication Systems (WFCS 2015). 27 to 29, May, 2015, TII-SS-2: Scheduling and Performance Analysis. Palma de Mallorca, Spain.

Semi-Partitioned Scheduling of Fork-Join Tasks using Work-Stealing

13th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC 2015). 21 to 23, Oct, 2015, Session W1-A: Multiprocessing and Multicore Architectures. Porto, Portugal.

Keyword search across distributed heterogenous structured data sources

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Effect of bird density on the decision to join a group in the Sicalis flaveola pelzeni (Passeriformes, Emberizidae)

A change in bird density within a captive flock of Sicalis flaveola pelzeni (Sclater, 1872) affected the decision to join a group. Ruling out inter-individual differences and maintaining constant the size of a food patch, birds were found to fly more often to the food source and spend a longer time in its environs when kept in greater groups.

Who we are and who can join us: National identity content and entry criteria for new immigrants

We argue that attitudes about immigration can be better understood by paying closer attention to the various ways in which national group boundaries are demarcated. We describe two related lines of work that address this. The first deals with national group definitions and, based on evidence from studies carried out in England and analyses of international survey data, argues that the relationship between national identification and prejudice toward immigrants is contingent on the extent to which ethnic or civic definitions of nationality are endorsed. The second, which uses European survey data, examines support for ascribed and acquired criteria that can be applied when determining who is permitted to migrate to one's country, and the various forms of national and individual threat that affect support for these criteria. We explain how the research benefits from a multilevel approach and also suggest how these findings relate to some current policy debates.

Progress in cardiovascular anastomoses: will the vascular join replace Carrel's technique?

BACKGROUND: Vascular reconstructions are becoming challenging due to the comorbidity of the aging population and since the introduction of minimally invasive approaches. Many sutureless anastomosis devices have been designed to facilitate the cardiovascular surgeon's work and the vascular join (VJ) is one of these. We designed an animal study to assess its reliability and long-term efficacy. METHODS: VJ allows the construction of end-to-end and end-to-side anastomoses. It consists of two metallic crowns fixed to the extremity of the two conduits so that vessel edges are joined layer by layer. There is no foreign material exposed to blood. In adult sheep both carotid arteries were prepared and severed. End-to-end anastomoses were performed using the VJ device on one side and the classical running suture technique on the other side. Animals were followed-up with Duplex-scan every 3 months and sacrificed after 12 months. Histopathological analysis was carried out. RESULTS: In 20 animals all 22 sutureless anastomoses were successfully completed in less than 2 min versus 6 +/- 3 min for running suture. Duplex showed the occlusion of three controls and one sutureless anastomosis. Two controls and one sutureless had stenosis >50%. Histology showed very thin layer of myointimal hyperplasia (50 +/- 10 microm) in the sutureless group versus 300 +/- 27 microm in the control. No significant inflammatory reaction was detected. CONCLUSIONS: VJ provides edge-to-edge vascular repair that can be considered the most physiological way to restore vessel continuity. For the first time, in healthy sheep, an anastomotic device provided better results than suture technique.

Reconstruction of the join time-delay Doppler-scale reflectivity density in the wide-band regime. A frame theory based approach

The inverse scattering problem concerning the determination of the joint time-delayDoppler-scale reflectivity density characterizing continuous target environments is addressed by recourse to the generalized frame theory. A reconstruction formula,involving the echoes of a frame of outgoing signals and its corresponding reciprocalframe, is developed. A ‘‘realistic’’ situation with respect to the transmission ofa finite number of signals is further considered. In such a case, our reconstruction formula is shown to yield the orthogonal projection of the reflectivity density onto a subspace generated by the transmitted signals.

Keyword Competition and Determinants of Ad Position in Sponsored Search Advertising

Given the significant growth of the Internet in recent years, marketers have been striving for new techniques and strategies to prosper in the online world. Statistically, search engines have been the most dominant channels of Internet marketing in recent years. However, the mechanics of advertising in such a market place has created a challenging environment for marketers to position their ads among their competitors. This study uses a unique cross-sectional dataset of the top 500 Internet retailers in North America and hierarchical multiple regression analysis to empirically investigate the effect of keyword competition on the relationship between ad position and its determinants in the sponsored search market. To this end, the study utilizes the literature in consumer search behavior, keyword auction mechanism design, and search advertising performance as the theoretical foundation. This study is the first of its kind to examine the sponsored search market characteristics in a cross-sectional setting where the level of keyword competition is explicitly captured in terms of the number of Internet retailers competing for similar keywords. Internet retailing provides an appropriate setting for this study given the high-stake battle for market share and intense competition for keywords in the sponsored search market place. The findings of this study indicate that bid values and ad relevancy metrics as well as their interaction affect the position of ads on the search engine result pages (SERPs). These results confirm some of the findings from previous studies that examined sponsored search advertising performance at a keyword level. Furthermore, the study finds that the position of ads for web-only retailers is dependent on bid values and ad relevancy metrics, whereas, multi-channel retailers are more reliant on their bid values. This difference between web-only and multi-channel retailers is also observed in the moderating effect of keyword competition on the relationships between ad position and its key determinants. Specifically, this study finds that keyword competition has significant moderating effects only for multi-channel retailers.

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs

A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two algorithms, one serial and one parallel, to maintain series-parallel (SP) relationships "on the fly" for fork-join multithreaded programs. The serial SP-order algorithm runs in O(1) amortized time per operation. In contrast, the previously best algorithm requires a time per operation that is proportional to Tarjan’s functional inverse of Ackermann’s function. SP-order employs an order-maintenance data structure that allows us to implement a more efficient "English-Hebrew" labeling scheme than was used in earlier race detectors, which immediately yields an improved determinacy-race detector. In particular, any fork-join program running in T₁ time on a single processor can be checked on the fly for determinacy races in O(T₁) time. Corresponding improved bounds can also be obtained for more sophisticated data-race detectors, for example, those that use locks. By combining SP-order with Feng and Leiserson’s serial SP-bags algorithm, we obtain a parallel SP-maintenance algorithm, called SP-hybrid. Suppose that a fork-join program has n threads, T₁ work, and a critical-path length of T[subscript ∞]. When executed on P processors, we prove that SP-hybrid runs in O((T₁/P + PT[subscript ∞]) lg n) expected time. To understand this bound, consider that the original program obtains linear speed-up over a 1-processor execution when P = O(T₁/T[subscript ∞]). In contrast, SP-hybrid obtains linear speed-up when P = O(√T₁/T[subscript ∞]), but the work is increased by a factor of O(lg n).