Sciweavers

2104 search results - page 25 / 421
» Sorting with networks of data structures
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
SIGMOD
2000
ACM
164views Database» more  SIGMOD 2000»
13 years 11 months ago
A Data Model and Data Structures for Moving Objects Databases
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
Luca Forlizzi, Ralf Hartmut Güting, Enrico Na...
MST
2002
128views more  MST 2002»
13 years 7 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
The Forgiving Tree: A Self-Healing Distributed Data Structure
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Treh...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...