Sciweavers

6650 search results - page 690 / 1330
» Mutating database queries
Sort
View
202
Voted
CINQ
2004
Springer
163views Database» more  CINQ 2004»
16 years 20 days ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
205
Voted
BTW
2003
Springer
94views Database» more  BTW 2003»
16 years 15 days ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DASFAA
2006
IEEE
174views Database» more  DASFAA 2006»
15 years 11 months ago
Communication-Efficient Implementation of Range-Joins in Sensor Networks
Sensor networks are multi-hop wireless networks of resource constrained sensor nodes used to realize high-level collaborative sensing tasks. To query and access data generated and ...
Aditi Pandit, Himanshu Gupta
226
Voted
DBSEC
2009
112views Database» more  DBSEC 2009»
15 years 8 months ago
Distributed Anonymization: Achieving Privacy for Both Data Subjects and Data Providers
There is an increasing need for sharing data repositories containing personal information across multiple distributed and private databases. However, such data sharing is subject t...
Pawel Jurczyk, Li Xiong
WWW
2008
ACM
16 years 8 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...