Sciweavers

2634 search results - page 462 / 527
» Faster Than Uppaal
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 10 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 10 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGMOD
2001
ACM
134views Database» more  SIGMOD 2001»
14 years 10 months ago
Preservation of Digital Data with Self-Validating, Self-Instantiating Knowledge-Based Archives
Digital archives are dedicated to the long-term preservation of electronic information and have the mandate to enable sustained access despite rapid technology changes. Persistent...
Bertram Ludäscher, Richard Marciano, Reagan Moore