Sciweavers

1992 search results - page 229 / 399
» Implementing sorting in database systems
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
BIBE
2000
IEEE
110views Bioinformatics» more  BIBE 2000»
14 years 28 days ago
FURY: Fuzzy Unification and Resolution Based on Edit Distance
We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution con...
David Gilbert, Michael Schroeder
SIGMOD
2009
ACM
130views Database» more  SIGMOD 2009»
14 years 9 months ago
FlashLogging: exploiting flash devices for synchronous logging performance
Synchronous transactional logging is the central mechanism for ensuring data persistency and recoverability in database systems. Unfortunately, magnetic disks are ill-suited for t...
Shimin Chen
ISMIR
2000
Springer
128views Music» more  ISMIR 2000»
14 years 27 days ago
PROMS: A Web-based Tool for Searching in Polyphonic Music
One major task of a digital music library (DML) is to provide techniques to locate a queried musical pattern in all pieces of music in the database containing that pattern. For a ...
Michael Clausen, R. Engelbrecht, D. Meyer, J. Schm...
EDBT
1994
ACM
117views Database» more  EDBT 1994»
14 years 1 months ago
Content Routing for Distributed Information Servers
We describe a system that provides query based associative access to the contents of distributed information servers. In typical distributed information systems there are so many o...
Mark A. Sheldon, Andrzej Duda, Ron Weiss, James O'...