Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Other Computer Sciences (49)
- Theory and Algorithms (44)
- OS and Networks (37)
- Numerical Analysis and Scientific Computing (33)
- Graphics and Human Computer Interfaces (32)
-
- Systems Architecture (27)
- Social and Behavioral Sciences (25)
- Software Engineering (24)
- Library and Information Science (23)
- Information Security (21)
- Programming Languages and Compilers (18)
- Archival Science (14)
- Artificial Intelligence and Robotics (10)
- Engineering (5)
- Scholarly Publishing (5)
- Cataloging and Metadata (4)
- Computer Engineering (4)
- Digital Communications and Networking (3)
- Scholarly Communication (3)
- American Popular Culture (2)
- American Studies (2)
- Arts and Humanities (2)
- Data Science (2)
- Amino Acids, Peptides, and Proteins (1)
- Anatomy (1)
- Cells (1)
- Chemicals and Drugs (1)
- Institution
- Keyword
-
- Digital libraries (8)
- Peer-to-peer computing (6)
- Computer science (5)
- Data Mining, Software Engineering (5)
- Web archives (5)
-
- Delay (4)
- Graph theory (4)
- P2P networks (4)
- Probability (4)
- Resilience (4)
- Web archiving (4)
- Analytical models (3)
- Artificial intelligence (3)
- Classification (3)
- Information retrieval (3)
- Large-scale systems (3)
- Memento (3)
- Out-of-turn interaction (3)
- Peer to peer computing (3)
- Peer-to-peer (3)
- Random processes (3)
- User churn (3)
- Web archive (3)
- ArXiv (2)
- Communications Society (2)
- Create-based method (2)
- Deep learning (2)
- Digital preservation (2)
- Failure analysis (2)
- Gnutella networks (2)
- Publication Year
- File Type
Articles 91 - 95 of 95
Full-Text Articles in Databases and Information Systems
The Ups Prototype: An Experimental End-User Service Across E-Print Archives, Herbert Van De Sompel, Thomas Krichel, Michael L. Nelson, Patrick Hochstenbach, Victor Lyapunov, Kurt Maly, Mohammad Zubair, Mohamed Kholief, Xiaoming Liu, Heath O'Connell
The Ups Prototype: An Experimental End-User Service Across E-Print Archives, Herbert Van De Sompel, Thomas Krichel, Michael L. Nelson, Patrick Hochstenbach, Victor Lyapunov, Kurt Maly, Mohammad Zubair, Mohamed Kholief, Xiaoming Liu, Heath O'Connell
Computer Science Faculty Publications
A meeting was held in Santa Fe, New Mexico, October 21-22, 1999, to generate discussion and consensus about interoperability of publicly available scholarly information archives. The invitees represented several well known e-print and report archive initiatives, as well as organizations with interests in digital libraries and the transformation of scholarly communication. The central goal of the meeting was to agree on recommendations that would make the creation of end-user services -- such as scientific search engines and linking systems -- for data originating from distributed and dissimilar archives easier. The Universal Preprint Service (UPS) Prototype was developed in preparation for …
A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu
A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu
Computer Science Faculty Publications
Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=22 nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …
A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen
A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen
Computer Science Faculty Publications
An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time. In contrast to the min-max heaps, it is shown that two min–max–pair heaps can be merged in sublinear time. More precisely, two min–max–pair heaps of sizes n and k can be merged in time O(log (n/k) * log k).
Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell
Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell
Computer Science Faculty Publications
Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Computer Science Faculty Publications
Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.