Sciweavers

342 search results - page 18 / 69
» Conjunctive Queries over Trees
Sort
View
AUSDM
2008
Springer
227views Data Mining» more  AUSDM 2008»
13 years 9 months ago
Exploratory Mining over Organisational Communications Data
Exploratory data mining is fundamental to fostering an appreciation of complex datasets. For large and continuously growing datasets, such as obtained by regular sampling of an or...
Alan Allwright, John F. Roddick
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
WISE
2006
Springer
14 years 1 months ago
Efficient Filtering Query Indexing in Data Stream
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
Ying Wang, Shuo Bai, Jianlong Tan, Li Guo
ICDE
2010
IEEE
272views Database» more  ICDE 2010»
14 years 7 months ago
SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 1 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...