Sciweavers

511 search results - page 52 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
WIDM
2006
ACM
16 years 1 days ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
15 years 7 months ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 6 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 6 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
ASUNAM
2011
IEEE
14 years 6 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...