Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Okay, as I've noted in other questions, I'm not a sophisticated database user even though I took my first course in relational algebra from ted Codd. I've now inherited an application that occasionally gets into what, to my naive mind, strikes me as a bad place.

SHOW PROCESSLIST; shows multiple locked thrads, each of them with exactly identical INSERT statements, viz:

INSERT LOW_PRIORITY IGNORE INTO node (f0, f1, f2, f3) VALUES ('group', 'larry', 'moe', 'curly')

Am I right that this is a Bad Thing? What would the expected consequences be?


As requested, here's the table:

  `id` bigint(20) NOT NULL AUTO_INCREMENT,
  `graph` varchar(100) CHARACTER SET latin1 DEFAULT NULL,
  `f1` varchar(200) NOT NULL,
  `f2` varchar(200) NOT NULL,
  `f3` mediumtext NOT NULL,
  PRIMARY KEY (`id`),
  UNIQUE KEY `nodeindex` (`graph`(20),`f1`(100),`f2`(100),`f3`(100)),
  KEY `ix_node_f1` (`f1`),
  KEY `ix_node_graph` (`graph`),
  KEY `ix_node_f3` (`f3`(255)),
  KEY `ix_node_f2` (`f2`),
  KEY `node_po` (`f2`,`f3`(130)),
  KEY `node_so` (`f1`,`f3`(130)),
  KEY `node_sp` (`f1`,`f2`(130)),
  FULLTEXT KEY `node_search` (`f3`)
share|improve this question
Please run SHOW CREATE TABLE node\G and post the output. – RolandoMySQLDBA Nov 21 '13 at 23:04
Does the table structure matter? I'd think that question would be independent. – Charlie Martin Nov 22 '13 at 17:30

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.