Results 1 - 10
of
7,861
Query evaluation techniques for large databases
- ACM COMPUTING SURVEYS
, 1993
"... Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On ..."
Abstract
-
Cited by 767 (11 self)
- Add to MetaCart
is essential for the designer of database management software. This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and post
The Cache Performance and Optimizations of Blocked Algorithms
- In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused
Probabilistic Inference Using Markov Chain Monte Carlo Methods
, 1993
"... Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because probabilistic models with the necessary realism and flexibility lead to complex distributions over high-dimensional spaces. R ..."
Abstract
-
Cited by 736 (24 self)
- Add to MetaCart
. Related problems in other fields have been tackled using Monte Carlo methods based on sampling using Markov chains, providing a rich array of techniques that can be applied to problems in artificial intelligence. The "Metropolis algorithm" has been used to solve difficult problems in statistical
Summaries of Affymetrix GeneChip probe level data
- Nucleic Acids Res
, 2003
"... High density oligonucleotide array technology is widely used in many areas of biomedical research for quantitative and highly parallel measurements of gene expression. Affymetrix GeneChip arrays are the most popular. In this technology each gene is typically represented by a set of 11±20 pairs of pr ..."
Abstract
-
Cited by 471 (21 self)
- Add to MetaCart
High density oligonucleotide array technology is widely used in many areas of biomedical research for quantitative and highly parallel measurements of gene expression. Affymetrix GeneChip arrays are the most popular. In this technology each gene is typically represented by a set of 11±20 pairs
Genome-wide array analysis of normal and malformed human hearts. Circulation 107
, 2003
"... Background—We present the first genome-wide cDNA array analysis of human congenitally malformed hearts and attempted to partially elucidate these complex phenotypes. Most congential heart defects, which account for the largest number of birth defects in humans, represent complex genetic disorders. A ..."
Abstract
-
Cited by 21 (5 self)
- Add to MetaCart
Background—We present the first genome-wide cDNA array analysis of human congenitally malformed hearts and attempted to partially elucidate these complex phenotypes. Most congential heart defects, which account for the largest number of birth defects in humans, represent complex genetic disorders
DNA Barcoding: a new tool with wide array of applications
, 2013
"... DNA barcoding is a new term introduced in to scientific literatures by Hebert and coworkers almost a decade ago (1). The concept of barcoding alone is well-known to the public: a series of black bars printed on many commercial products (1-3) (Universal Product Code), which are used to distinguish di ..."
Abstract
- Add to MetaCart
DNA barcoding is a new term introduced in to scientific literatures by Hebert and coworkers almost a decade ago (1). The concept of barcoding alone is well-known to the public: a series of black bars printed on many commercial products (1-3) (Universal Product Code), which are used to distinguish different products. Advances made in molecular biology and molecular techniques late 20th century e.g. sequencing technologies, has inspired scientists to apply barcoding concept to all domains of life by using the unique nature of DNA for each single species, in order to generate a comprehensive library of living organisms on the planet earth (2, 6). Such an ambitious initiative would result in a global DNA barcode database which will be valuable for biological scientists, medical, governmental and legal agencies as a mean of identification (1). The first initiative for DNA barcoding was funded in Canada and later on several DNA barcoding campaigns came in to the scene. The International Barcode of Life consortium
Carnegie Mellon’s CyDAT Harnessing a Wide Array of Telemetry Data to Enhance Distributed System Diagnostics
"... The number and complexity of distributed applications has exploded, and to-date, each has had to create its own method for providing diagnostic tools and performance metrics. These distributed services have become increasingly dependent, not only on the system and network infrastructures upon which ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The number and complexity of distributed applications has exploded, and to-date, each has had to create its own method for providing diagnostic tools and performance metrics. These distributed services have become increasingly dependent, not only on the system and network infrastructures upon which they are built, but also each other. The effectiveness of a diagnostician is seriously hindered by the difficulty in accessing diagnostic data. However, even when access can be gained, it exposes the daunting challenge of correlating a myriad of different data formats and an incredible amount of data (both in static files and real time streams). To say that diagnosis of distributed systems is a complex and difficult is a vast understatement; and the task is getting tougher every day. There is a paucity of tools, data mining methods and logfile standards that has been worsening for years. Researchers face the same difficulty in gaining access to data for purposes of experimentation. Responding to these difficulties, we've established the CyDAT (Cyber-center for Diagnostics Analytics and Telemetry) effort within CyLAB at Carnegie Mellon, to enable researchers to interact with a rich and varied set of data in an open, multi-vendor environment that enables and supports open, interdisciplinary research. This paper described the CyDAT and a reference implementation of an event framework (EDDY) to normalize, transform, and transport telemetry data to the analytics that need them, providing a means for tackling the diagnostic Hydra.
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
, 2005
"... The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ. ..."
Abstract
-
Cited by 239 (20 self)
- Add to MetaCart
The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ
Simple linear work suffix array construction
, 2003
"... Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more exp ..."
Abstract
-
Cited by 215 (8 self)
- Add to MetaCart
Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more
Results 1 - 10
of
7,861