Sciweavers

4536 search results - page 381 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 7 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
16 years 13 days ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 8 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
PVLDB
2008
138views more  PVLDB 2008»
15 years 6 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik