Sciweavers

6905 search results - page 933 / 1381
» Querying Multidimensional Databases
Sort
View
ICPR
2008
IEEE
16 years 6 months ago
Indexing iris images
Given a query iris image, the goal of indexing is to identify and retrieve a small subset of candidate irides from the database in order to determine a possible match. This can si...
Arun Ross, Rajiv Mukherjee
VLDB
2007
ACM
95views Database» more  VLDB 2007»
16 years 5 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
16 years 5 months ago
Peer-to-peer management of XML data: issues and research challenges
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...
Georgia Koloniari, Evaggelia Pitoura
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 5 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna