Top-k query is an efficient way to show the most important objects to user from massive amounts of data. After huge effort working on database performance, recently, an explain capability has attract more attention in recent years. In top-k query, since people may not specify his/her accurate preference, he may feel frustrated with the top-k results and propose a question such that “why my expe...

Phylogenies are useful for organizing knowledge of biological diversity, for structuring classifications, and for providing knowledge of events that occurred during evolution. Different phylogenetic reconstruction techniques are available. In this paper Distance based technique is used. Distance measure is an important issue in phylogenetic analysis. Traditional approaches are time-consuming du...

Routers must perform packet classi cation at high speeds to e ciently implement functions such as rewalls and QoS routing. Packet classi cation requires matching each packet against a database of lters (or rules), and forwarding the packet according to the highest priority lter. Existing lter schemes with fast lookup time do not scale to large lter databases. Other more scalable schemes work fo...

The SQL group-by operator plays an important role in summarizing and aggregating large datasets in a data analytics stack. The Similarity SQL-based Group-By operator (SGB, for short) extends the semantics of the standard SQL Group-by by grouping data with similar but not necessarily equal values. While existing similarity-based grouping operators efficiently realize these approximate semantics,...

PURPOSE Here we describe LifePrint, a sequence alignment-independent k-tuple distance method to estimate relatedness between complete genomes. METHODS We designed a representative sample of all possible DNA tuples of length 9 (9-tuples). The final sample comprises 1878 tuples (called the LifePrint set of 9-tuples; LPS9) that are distinct from each other by at least two internal and noncontigu...

.................................................................................................... i Dedication .............................................................................................. iii Acknowledgements................................................................................ iv Declaration............................................................................

As publication networks grow it becomes difficult to grasp their key influences and directions by examining individual papers. Making queries on specific topics or trying to understand how various topics interact within the research field is even more challenging. Tuple is an exploratory visualization system which provides category-based overview of publication data. Using well established visu...

The idea of tuple spaces is based on the white-board design pattern & made its first appearance in the late 1980s. Similar to its mathematical interpretation, we identify tuple as a set of values separated by some kind of delimiter. For an example we can represent the name, birth year & the home town of a student using a simple tuple . In our work, we have implemented a tup...

Our interest lies in identifying the distinguishing sub-sequences of the selected bacterial group, based on 16s rDNA sequence data, which could be used further for generating genus specific tracking protocols. We have used two criterions the identification of repeating consistent k-tuple of varying in sizes and secondly, discriminating dinucleotide feature. We have developed a program Repeat Tu...

Partial persistent index structures support efficient access to current and past versions of objects, while updates are allowed on the current version. The Multiversion B-Tree (MVBT) represents a partially persistent index-structure with both, asymptotic worst-case performance and excellent performance in real life applications. Updates are performed tuple-by-tuple with the same asymptotic perf...