Sciweavers

11231 search results - page 48 / 2247
» Digging for Data Structures
Sort
View
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 10 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
ICML
2003
IEEE
14 years 10 months ago
Identifying Predictive Structures in Relational Data Using Multiple Instance Learning
This paper introduces an approach for identifying predictive structures in relational data using the multiple-instance framework. By a predictive structure, we mean a structure th...
Amy McGovern, David Jensen
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 11 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
DMDW
2003
120views Management» more  DMDW 2003»
13 years 11 months ago
Well-formed data warehouse structures
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...
Michel Schneider
PLDI
2010
ACM
14 years 2 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta