Sciweavers

611 search results - page 67 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 11 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
CASCON
2001
148views Education» more  CASCON 2001»
13 years 11 months ago
A Pareto model for OLAP view size estimation
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
Thomas P. Nadeau, Toby J. Teorey
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 1 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
EKAW
2010
Springer
13 years 8 months ago
Scaling Up Question-Answering to Linked Data
Linked Data semantic sources, in particular DBpedia, can be used to answer many user queries. PowerAqua is an open multi-ontology Question Answering (QA) system for the Semantic We...
Vanessa Lopez, Andriy Nikolov, Marta Sabou, Victor...
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
14 years 1 days ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...