Sciweavers

7529 search results - page 1385 / 1506
» The Modula-3 Type System
Sort
View
268
Voted
POPL
2004
ACM
16 years 4 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
216
Voted
VLDB
2006
ACM
124views Database» more  VLDB 2006»
16 years 4 months ago
Dynamic buffer management with extensible replacement policies
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...
Chong Leng Goh, Yanfeng Shu, Zhiyong Huang, Beng C...
242
Voted
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 4 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
173
Voted
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
16 years 4 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
133
Voted
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 4 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
« Prev « First page 1385 / 1506 Last » Next »