Sciweavers

301 search results - page 39 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
JACM
2008
91views more  JACM 2008»
14 years 11 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
172
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
15 years 11 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
VLDB
2007
ACM
128views Database» more  VLDB 2007»
15 years 5 months ago
A genetic approach for random testing of database systems
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleks...
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
16 years 11 days ago
Similarity Search in Arbitrary Subspaces Under Lp-Norm
Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves...
Xiang Lian, Lei Chen 0002
95
Voted
COMAD
2008
15 years 14 days ago
CUM: An Efficient Framework for Mining Concept Units
Web is the most important repository of different kinds of media such as text, sound, video, images etc. Web mining is the process of applying data mining techniques to automatica...
Santhi Thilagam