Filters








19,830 Hits in 6.1 sec

Efficient disk allocation for fast similarity searching

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi
1998 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98  
As databases increasingly integrate non-textual information it is becoming necessary to support efficient similarity searching in addition to range searching.  ...  In this paper, we propose a new scheme which provides good declustering for similarity searching.  ...  Concluding Remarks The problem of efficient similarity searching is becoming important for databases as non-textual information is stored.  ... 
doi:10.1145/277651.277674 dblp:conf/spaa/PrabhakarAA98 fatcat:aqvxoor6szadfdzgj3nxr2ysxq

Clustering declustered data for efficient retrieval

Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi
1999 Proceedings of the eighth international conference on Information and knowledge management - CIKM '99  
In this paper, we first establish that besides exploiting the parallelism, a careful organization of each disk must be considered for fast searching.  ...  Declustering techniques for multi-disk architectures have been effectively used for storage.  ...  Using the page allocation technique results in speedup of 2.7 to 4.45 for average disks (see [lo] for fast disk results).  ... 
doi:10.1145/319950.320026 dblp:conf/cikm/FerhatosmanogluAA99 fatcat:d7wfgudlando7prkdwp3xgj3ry

Efficient Algorithms for Persistent Storage Allocation

Arun Iyengar, Shudong Jin, Jim Challenger
2001 Mass Storage Systems and Technologies(MSS), Proceedings of the NASA Goddard Conference on  
Efficient disk storage is a crucial component for many applications.  ...  This paper presents efficient algorithms for managing persistent storage which usually only require a single seek for allocations and deallocations and allow the state of the system to be fully recoverable  ...  They further develop an efficient method for disk writes (called STREAM) which writes data continuously on the disks. STREAM works in a way similar to log-structured file systems [10, 13] .  ... 
doi:10.1109/mss.2001.10009 dblp:conf/mss/IyengarJC01 fatcat:3enerdfspre45bqailjxqwqzoy

Fast and Effective Focused Retrieval [chapter]

Andrew Trotman, Xiang-Fei Jia, Shlomo Geva
2010 Lecture Notes in Computer Science  
Building an efficient and an effective search engine is a very challenging task.  ...  In this paper, we present the efficiency and effectiveness of our search engine at the INEX 2009 Efficiency and Ad Hoc Tracks.  ...  In the future, we will continue to work on pruning for more efficient query evaluation.  ... 
doi:10.1007/978-3-642-14556-8_24 fatcat:eunclewq45d6larmybx3ctdj6i

Write-Optimized B-Trees [chapter]

Goetz Graefe
2004 Proceedings 2004 VLDB Conference  
The result retains fine-granularity locking, full transactional ACID guarantees, fast search performance, etc. expected of a modern B-tree implementation, yet adds efficient transacted page relocation  ...  locating B-tree nodes on disk.  ...  These bitmaps can guide fast disk-order index scans, provide added redundancy during consistency checks, and speed the search for a "lost" page identified in a consistency check.  ... 
doi:10.1016/b978-012088469-8.50060-7 dblp:conf/vldb/Graefe04 fatcat:2qg32qrzkneorlbshbpf4vfc7u

Write-Optimized B-Trees [chapter]

G GRAEFE
2004 Proceedings 2004 VLDB Conference  
The result retains fine-granularity locking, full transactional ACID guarantees, fast search performance, etc. expected of a modern B-tree implementation, yet adds efficient transacted page relocation  ...  locating B-tree nodes on disk.  ...  These bitmaps can guide fast disk-order index scans, provide added redundancy during consistency checks, and speed the search for a "lost" page identified in a consistency check.  ... 
doi:10.1016/b978-012088469-8/50060-7 fatcat:5pjp64q25jhslh3uvxtrdkzfua

The five-minute rule twenty years later, and how flash memory changes the rules

Goetz Graefe
2007 Proceedings of the 3rd international workshop on Data management on new hardware - DaMoN '07  
transfer bandwidths, and it also applies to flash disks holding small pages appropriate for their fast access latency.  ...  With the advent of flash memory in the gap between traditional RAM main memory and traditional disk systems, the five-minute rule now applies to large pages appropriate for today's disks and their fast  ...  Thus, tracking a data page when it moves between disk and flash relies on the same data structure maintained for efficient database search.  ... 
doi:10.1145/1363189.1363198 dblp:conf/damon/Graefe07 fatcat:ras2jov3ojb4pnvyihcqaet6vy

Concentric hyperspaces and disk allocation for fast parallel range searching

H. Ferhatosmanoglu, D. Agrawal, A. El Abbadi
1999 Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)  
We then develop disk allocation methods for each of the proposed schemes.  ...  Numerous declustering and disk allocation techniques have been proposed in the literature.  ...  Several index structures are proposed for efficient range, partial match, and similarity searching in traditional databases.  ... 
doi:10.1109/icde.1999.754977 dblp:conf/icde/FerhatosmanogluAA99 fatcat:psux4hfrsveujoerahbiudiuqu

Incremental Text Indexing for Fast Disk-Based Search

Giorgos Margaritis, Stergios V. Anastasiadis
2014 ACM Transactions on the Web  
Incremental text indexing for fast disk-based search.  ...  For the support of fast search over disk-based storage, we take a fresh look at incremental text indexing in the context of current architectural features.  ...  They would also like to thank Argyris Kalogeratos for his detailed feedback on an earlier draft.  ... 
doi:10.1145/2560800 fatcat:bdwpapill5g6lawoih67ojljaa

Techniques for efficiently allocating persistent storage

Arun Iyengar, Shudong Jin, Jim Challenger
2003 Journal of Systems and Software  
Efficient disk storage is a crucial component for many applications.  ...  This paper presents efficient algorithms for managing persistent storage which usually only require a single seek for allocations and deallocations and allow the state of the system to be fully recoverable  ...  One extension is to develop a similar sort of disk storage allocator which would be efficient for storing objects smaller than one sector.  ... 
doi:10.1016/s0164-1212(02)00141-3 fatcat:slet4jonhfd67pddaviyy7b7c4

Subject Index

2007 Journal of Discrete Algorithms  
a simple polygon, 524; Regular expression constrained sequence alignment, 647 Edit distance Efficient generation of super condensed neighborhoods, 501; Text indexing with errors, 662; Comparing similar  ...  Negative Cost Cycle Detection in net- works, 408 Directed graphs Algorithms for computing parameters of graph-based extensions of BCH codes, 553 Disk architecture Failed disk recovery in double erasure  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi

Dynamic role allocation for small search engine clusters

Ndapandula Nakashole, Hussein Suleman, Calvin Pedzai
2007 Proceedings of the 2007 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries - SAICSIT '07  
Search engines facilitate efficient discovery of information in large information environments such as the Web.  ...  Existing solutions to these scalability problems are often designed for large computer clusters. This paper presents a flexible solution that is deployable also on small clusters.  ...  [12] describe the design of their cluster-based search engine called My Own Search Engine (MOSE). Their aim is to increase query throughput by implementing an efficient parallelization strategy.  ... 
doi:10.1145/1292491.1292502 dblp:conf/saicsit/NakasholeSP07 fatcat:pqpdsaxaivfo3hyciossh7fbmq

The five-minute rule 20 years later (and how flash memory changes the rules)

Goetz Graefe
2009 Communications of the ACM  
auxiliary structures may enable efficient interpolation search instead of binary search.  ...  Thus, tracking a data page when it moves between disk and flash relies on the same data structure maintained for efficient database search.  ... 
doi:10.1145/1538788.1538805 fatcat:xp7fshkosnbvjjd6ljdwy6cnsm

The Pharmit backend: A computer systems approach to enabling interactive online drug discovery

D. R. Koes
2018 IBM Journal of Research and Development  
The key concepts are to maximize parallelism while minimizing intra-thread communication, optimize data layout for sequential processing, and efficiently manage memory allocation.  ...  Pharmit (http://pharmit.csb.pitt.edu) is an open-source online resource that allows users to interactively search libraries of millions compounds as part of a structure-based drug discovery workflow.  ...  Acknowledgment We thank Jocelyn Sunseri for help proofreading this manuscript. This work was supported in part by a grant from R01GM108340 from the National Institute of General Medical Sciences.  ... 
doi:10.1147/jrd.2018.2883977 pmid:33871478 pmcid:PMC8049614 fatcat:pztjsbig75d2jdsca7z6xped2y

The Five-minute Rule 20 Years Later

Goetz Graefe
2008 Queue  
auxiliary structures may enable efficient interpolation search instead of binary search.  ...  Thus, tracking a data page when it moves between disk and flash relies on the same data structure maintained for efficient database search.  ... 
doi:10.1145/1413254.1413264 fatcat:agyvtchklnf4zcl3fzttcbccda
« Previous Showing results 1 — 15 out of 19,830 results