Sciweavers

415 search results - page 12 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
SUM
2010
Springer
13 years 5 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
DAWAK
1999
Springer
13 years 11 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 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
TKDE
2002
127views more  TKDE 2002»
13 years 7 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
PERCOM
2006
ACM
14 years 7 months ago
Distributed Cross-Layer Scheduling for In-Network Sensor Query Processing
In-network sensor query processing is a cross-layer design paradigm in which networked sensor nodes process data acquisitional queries in collaboration with one another. As power ...
Hejun Wu, Qiong Luo, Wenwei Xue