401 search results - page 35 / 81 » Types for describing coordinated data structures |
CCCG
2010
13 years 9 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
DKE
2006
13 years 7 months ago
2006
We describe a framework called the Uni-Level Description (ULD) for accurately representing information from a broad range of data models. The ULD extends previous metadata-model a...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...