Sciweavers

1404 search results - page 84 / 281
» Increasing Concurrency in Databases Using Program Analysis
Sort
View
158
Voted
SCP
1998
163views more  SCP 1998»
15 years 1 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
91
Voted
SAC
2009
ACM
15 years 9 months ago
Measuring coherence between electronic and manual annotations in biological databases
The use of controlled structured vocabularies for annotation purposes, such as the Gene Ontology (GO) is currently one of the strategies to cope with the increasingly cumbersome t...
Catia Pesquita, Daniel Faria, Francisco M. Couto
145
Voted
PETRA
2009
ACM
15 years 8 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
110
Voted
CIKM
2009
Springer
15 years 8 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
220
Voted
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 3 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...