Sciweavers

11211 search results - page 237 / 2243
» Data Structures
Sort
View
WAE
2001
236views Algorithms» more  WAE 2001»
15 years 8 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
Jyrki Katajainen, Bjarke Buur Mortensen
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 10 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 6 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
DOCENG
2005
ACM
15 years 8 months ago
Schema matching for transforming structured documents
Structured document content reuse is the problem of restructuring and translating data structured under a source schema into an instance of a target schema. A notion closely tied ...
Aida Boukottaya, Christine Vanoirbeek
VLDB
2002
ACM
116views Database» more  VLDB 2002»
15 years 6 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...