Sciweavers

191 search results - page 6 / 39
» XPath Query Evaluation: Improving Time and Space Efficiency
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
BTW
2003
Springer
103views Database» more  BTW 2003»
14 years 1 months ago
XPath-Aware Chunking of XML-Documents
Dissemination systems are used to route information received from many publishers individually to multiple subscribers. The core of a dissemination system consists of an efficient...
Wolfgang Lehner, Florian Irmert
IJWET
2008
81views more  IJWET 2008»
13 years 8 months ago
XFIS: an XML filtering system based on string representation and matching
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
Panagiotis Antonellis, Christos Makris
CORR
1999
Springer
116views Education» more  CORR 1999»
13 years 8 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud