Sciweavers

6597 search results - page 21 / 1320
» Orderings and Types in Databases
Sort
View
PLPV
2010
ACM
14 years 4 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer
TPHOL
2005
IEEE
14 years 1 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
IAJIT
2010
95views more  IAJIT 2010»
13 years 6 months ago
Modelling of Updating Moving Object Database Using Timed Petri Net Model
: Tracking moving objects is one of the most common requirements for many location-based applications. The location of a moving object changes continuously but the database locatio...
Hatem Abdul-Kader, Warda El-Kholy
PODS
2006
ACM
186views Database» more  PODS 2006»
14 years 7 months ago
Flow algorithms for two pipelined filter ordering problems
Anne Condon, Amol Deshpande, Lisa Hellerstein, Nin...
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 1 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi