Sciweavers

627 search results - page 31 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
CORR
2004
Springer
82views Education» more  CORR 2004»
15 years 5 months ago
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
Christoph Koch, Stefanie Scherzinger, Nicole Schwe...
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
16 years 7 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
AMW
2010
15 years 7 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos
WILF
2009
Springer
487views Fuzzy Logic» more  WILF 2009»
16 years 4 months ago
A combined Fuzzy and Probabilistic data descriptor for distributed CBIR
With the wide diffusion of digital image acquisition devices, the cost of managing hundreds of digital images is quickly increasing. Currently, the main way to search digital ima...
Marco La Cascia, Marco Morana, Roberto Gallea
NJC
2006
102views more  NJC 2006»
15 years 6 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea