Sciweavers

530 search results - page 94 / 106
» Extensible Query Processing in Starburst
Sort
View
WWW
2007
ACM
14 years 10 months ago
Extending WebML towards semantic web
Available methodologies for developing Sematic Web applications do not fully exploit the whole potential deriving from interaction with ontological data sources. Here we introduce...
Federico Michele Facca, Marco Brambilla
VLDB
2007
ACM
174views Database» more  VLDB 2007»
14 years 10 months ago
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
Heng Tao Shen, Xiaofang Zhou, Aoying Zhou
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 10 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 10 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 10 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv