Sciweavers

562 search results - page 12 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
PODS
2004
ACM
158views Database» more  PODS 2004»
15 years 12 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
TOIS
2002
97views more  TOIS 2002»
14 years 11 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ADAEUROPE
2003
Springer
15 years 5 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
ICAD
2004
15 years 1 months ago
Orchestration Within the Sonification of Basic Data Sets
The use of sonification as a means of representing and analysing data has become a growing field of research in recent years and as such has become a far more accepted means of wo...
Charlie Cullen, Eugene Coyle
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 12 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu