Sciweavers

11573 search results - page 430 / 2315
» Designing Relational Databases
Sort
View
EDBT
2010
ACM
127views Database» more  EDBT 2010»
16 years 1 months ago
Trustworthy vacuuming and litigation holds in long-term high-integrity records retention
Relational databases are periodically vacuumed to remove tuples that have expired. During the discovery phase of litigation, plaintiffs ask defendants for access to information re...
Ragib Hasan, Marianne Winslett
190
Voted
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
16 years 1 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
HICSS
2006
IEEE
135views Biometrics» more  HICSS 2006»
16 years 27 days ago
Using Function Generalization to Design a Cosequential Processing Framework
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
H. Conrad Cunningham, Pallavi Tadepalli
179
Voted
ICPR
2002
IEEE
16 years 8 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
177
Voted
IPPS
2006
IEEE
16 years 27 days ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...