Sciweavers

2859 search results - page 154 / 572
» Querying Complex Structured Databases
Sort
View
JASIS
2002
99views more  JASIS 2002»
13 years 8 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
VLDB
2002
ACM
116views Database» more  VLDB 2002»
13 years 8 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 15 hour ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
ERCIMDL
2006
Springer
147views Education» more  ERCIMDL 2006»
13 years 12 months ago
An Enhanced Search Interface for Information Discovery from Digital Libraries
Libraries, museums, and other organizations make their electronic contents available to a growing number of users on the Web. A large fraction of the information published is store...
Georgia Koutrika, Alkis Simitsis
COMPGEOM
2010
ACM
14 years 1 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen