Sciweavers

464 search results - page 43 / 93
» On Support of Ordering in Multidimensional Data Structures
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 4 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICALP
2010
Springer
15 years 5 months ago
Mergeable Dictionaries
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
John Iacono, Özgür Özkan
SOFTVIS
2005
ACM
15 years 7 months ago
Visual data mining in software archives
Software archives contain historical information about the development process of a software system. Using data mining techniques rules can be extracted from these archives. In th...
Michael Burch, Stephan Diehl, Peter Weißgerb...
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 6 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
DEXAW
2003
IEEE
131views Database» more  DEXAW 2003»
15 years 6 months ago
Having a BLAST: Analyzing Gene Sequence Data with BlastQuest
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...