Sciweavers

643 search results - page 50 / 129
» Dynamic prioritization of database queries
Sort
View
DPD
2010
153views more  DPD 2010»
14 years 7 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
15 years 11 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
15 years 10 months ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
WWW
2006
ACM
15 years 10 months ago
FLUX: fuzzy content and structure matching of XML range queries
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal,...
DEXAW
2005
IEEE
155views Database» more  DEXAW 2005»
15 years 3 months ago
MediaPeer: A Safe, Scalable P2P Architecture for XML Query Processing
Increasing popularity of XML and P2P networks has generated much interest in distributed processing of XML data. We propose a novel solution organized around a mediator capable of...
Florin Dragan, Georges Gardarin, Laurent Yeh