Sciweavers

6974 search results - page 421 / 1395
» Querying Semi-Structured Data
Sort
View
ICDT
2003
ACM
91views Database» more  ICDT 2003»
16 years 2 days ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
COMPGEOM
1997
ACM
15 years 11 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
DOLAP
2005
ACM
15 years 8 months ago
Modeling, querying and reasoning about OLAP databases: a functional approach
We propose a new functional framework for modeling, querying and reasoning about OLAP databases. The framework represents data (data cubes and dimensional hierarchies) and queryin...
Ken Q. Pu
SEBD
2008
206views Database» more  SEBD 2008»
15 years 8 months ago
Efficient and Effective Query Answering in a PDMS with SUNRISE
Abstract. Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' co...
Federica Mandreoli, Riccardo Martoglia, Wilma Penz...
DPD
2006
114views more  DPD 2006»
15 years 6 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...