Sciweavers

2889 search results - page 113 / 578
» Querying Structured Hyperdocuments
Sort
View
JASIS
2002
99views more  JASIS 2002»
13 years 7 months ago
XQL and proximal nodes
We consider the recently proposed XQL language, which is designed to query XML documents by content and structure. We show that an already existing model, namely \Proximal Nodes&q...
Ricardo A. Baeza-Yates, Gonzalo Navarro
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
13 years 12 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
14 years 1 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
CCCG
2006
13 years 9 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...